d3.py

# # Devu, the Dumb Guy
# def devu_the_dumb_guy(n, x, c):
#   c.sort()
#   sum = 0
#   for num in c:
#     sum += num * x
#     if (x > 1):
#       x -= 1
#   print(sum)

# # Input
# nx = list(map(int, input().split()))
# n = nx[0]
# x = nx[1]
# c = list(map(int, input().split()))

# # Run and get output
# devu_the_dumb_guy(n, x, c)

# # Chores
# def chores(n, a, b, h):
#   h.sort()

#   l = 0
#   r = n - 1

#   while (l < b - 1):
#     l +=1

#   while (n - r < a):
#     r -= 1

#   if (l < r):
#     print(h[r] - h[l])
#   else:
#     print(0)

# # Input
# h = list(map(int, input().split()))

# # Run and get output
# chores(n, a, b, h)

# # Sort the Array
# def sort_the_array(n, a):
#   is_sorted = True

#   for i in range(n - 1):
#     if (a[i] > a[i + 1]):
#       is_sorted = False
#       break
#   if (is_sorted):
#     print("yes")
#     print(1, 1)
#     return
#   else:
#     l = 0
#     r = n - 1
#     if (n == 2):
#       print("yes")
#       print(l + 1, r + 1)
#       return

#     flag = 0

#     for i in range(n - 1):
#       if (a[i] > a[i + 1]):
#         l = i
#         break
#     for i in range(n - 1, 0, -1):
#       if (a[i] < a[i - 1]):
#         r = i
#         break

#     first = []
#     first = a[0:l:1]

#     reversed = a[l:r+1:1]
#     reversed = reversed[::-1]

#     last = []
#     last = a[r + 1:n:1]

#     final = [*first, *reversed, *last]

#     for i in range(n - 1):
#       if (final[i] > final[i + 1]):
#         flag = 1
#         break
#     if (flag):
#       print("no")
#     else:
#       print("yes")
#       print(l + 1, r + 1)

# # Input
# n = int(input())
# a = list(map(int, input().split()))

# # Run and get output
# sort_the_array(n, a)

# # GukiZ and Contest
# def gukiz_and_contest(n, a):
#   result = []
#   for i in range(n):
#     count = 1
#     for j in range(n):
#       if (a[i] < a[j]):
#         count += 1
#     result.append(count)

#   print(*result)

# # Input
# n = int(input())
# a= list(map(int, input().split()))

# # Run and get output
# gukiz_and_contest(n, a)

# # Pasha and Tea
# def pasha_and_tea(n, w, a):
#   a.sort()
  
#   x_max_with_w = w / (3*n)
#   x_max_with_min_w = a[0]
#   x_max_with_min_m = a[n] / 2

#   result = min(min(x_max_with_w, x_max_with_min_w), x_max_with_min_m) * n * 3

#   print(x_max_with_w, x_max_with_min_w, x_max_with_min_m)
#   print(result)


# # Input
# nw = list(map(int, input().split()))
# n = nw[0]
# w = nw[1]
# a = list(map(int, input().split()))

# # Run and get output
# pasha_and_tea(n, w, a)

# # Towers
# def towers(n, l):
#   l.sort()
  
#   max_l = 1
#   count = 1
#   distinct_l = 1
#   for i in range(n - 1):
#     if (l[i] == l[i + 1]):
#       count += 1
#       max_l = max(max_l, count)
#     else:
#       distinct_l += 1
#       count = 1

#   print(max_l, distinct_l)

  
# # Input
# n = int(input())
# l = list(map(int, input().split()))

# # Run and get output
# towers(n, l)

# # Business Trip
# def business_trip(n, l):
#   if (n == 0):
#     print(0)
#     return

#   l.sort(reverse=True)

#   min_month = 0
#   total = 0

#   for i in range(len(l)):
#     total += l[i]
#     if (total < n):
#       min_month += 1
#     else:
#       break
  
#   if (min_month + 1 > len(l)):
#     print(-1)
#   else:
#     print(min_month + 1)

# # Input
# n = int(input())
# l = list(map(int, input().split()))

# # Run and get output
# business_trip(n, l)

# Eight Point Sets
def eight_point_sets(points):
  fre_x = [False] * (10 ** 6 + 5)
  fre_y = [False] * (10 ** 6 + 5)
  distinct_x = []
  distinct_y = []

  for point in points:
    x, y = point
    if not fre_x[x]:
      fre_x[x] = True
      distinct_x.append(x)
    
    if not fre_y[y]:
      fre_y[y] = True
      distinct_y.append(y)

  if len(distinct_x) != 3 or len(distinct_y) != 3:
    print('ugly')
    return

  distinct_x.sort()
  distinct_y.sort()
  points.sort()
  index = 0

  for i in range(3):
    for j in range(3):
      if i == j == 1:
        continue
      if distinct_x[i] == points[index][0] and distinct_y[j] == points[index][1]:
        index += 1
      else:
        print('ugly')
        return

  print('respectable')

# Input
points = []
for _ in range(8):
  x, y = map(int, input().split())
  points.append((x, y))

# Run and get output
eight_point_sets(points)