#include <bits/stdc++.h>
using namespace std;
struct node {
  long x, y;
} point[9];
int cmp1(node a, node b) {
  if (a.x == b.x)
    return a.y < b.y;
  else
    return a.x < b.x;
}
int cmp2(node a, node b) {
  if (a.y == b.y)
    return a.x < b.x;
  else
    return a.y < b.y;
}
int main() {
  int flag = 0;
  for (int i = 0; i < 8; i++) {
    cin >> point[i].x >> point[i].y;
  }
  sort(point, point + 8, cmp1);
  if (point[0].x == point[1].x && point[1].x == point[2].x &&
      point[3].x == point[4].x && point[5].x == point[6].x &&
      point[6].x == point[7].x) {
    if (point[2].x != point[3].x && point[4].x != point[5].x)
      ;
    else
      flag = 1;
    if (point[0].y == point[1].y || point[1].y == point[2].y) flag = 1;
    if (point[3].y == point[4].y) flag = 1;
    if (point[5].y == point[6].y || point[6].y == point[7].y) flag = 1;
  } else
    flag = 1;
  sort(point, point + 8, cmp2);
  if (point[0].y == point[1].y && point[1].y == point[2].y &&
      point[3].y == point[4].y && point[5].y == point[6].y &&
      point[6].y == point[7].y) {
    if (point[2].y != point[3].y && point[4].y != point[5].y)
      ;
    else
      flag = 1;
    if (point[0].x == point[1].x || point[1].x == point[2].x) flag = 1;
    if (point[3].x == point[4].x) flag = 1;
    if (point[5].x == point[6].x || point[6].x == point[7].x) flag = 1;
  } else
    flag = 1;
  if (flag == 0)
    cout << "respectable" << endl;
  else
    cout << "ugly" << endl;
  return 0;
}
