#include <bits/stdc++.h>
using namespace std;
typedef struct PT {
  int x;
  int y;
  PT() {}
  PT(int a, int b) : x(a), y(b){};
  bool operator==(const PT &P) { return (P.x == x && P.y == y); }
} PT;
vector<PT> P;
set<int> S1, S2;
set<int>::iterator i1;
int v1[3], v2[3];
int A[3][3];
int main() {
  memset(A, 0, sizeof(A));
  int x, y;
  for (int i = 0; i < 9; i++) {
    scanf("%d%d", &x, &y);
    S1.insert(x);
    S2.insert(y);
    P.push_back(PT(x, y));
  }
  if (S1.size() > 3 || S2.size() > 3 || S1.size() < 3 || S2.size() < 3)
    printf("ugly\n");
  else {
    int i = 0, j = 0, cont = 0;
    for (i1 = S1.begin(); i1 != S1.end(); i1++) {
      v1[i++] = *(i1);
    }
    for (i1 = S2.begin(); i1 != S2.end(); i1++) {
      v2[j++] = *(i1);
    }
    sort(v1, v1 + 3);
    sort(v2, v2 + 3);
    for (int r = 0; r < 9; r++) {
      for (int k = 0; k < 3; k++) {
        for (int l = 0; l < 3; l++) {
          if (k != 1 || l != 1) {
            if (!A[k][l] && P[r].x == v1[k] && P[r].y == v2[l]) {
              cont++;
              A[k][l] = 1;
            }
          }
        }
      }
    }
    if (cont < 8)
      printf("ugly\n");
    else
      printf("respectable\n");
  }
  S1.clear();
  S2.clear();
  P.clear();
  return 0;
}
