#include <bits/stdc++.h>
using namespace std;
const int INF = 100000000;
const double eps = 1e-10;
const int MAXN = 110;
set<int> sx, sy;
int in[10][2];
set<int>::iterator it1, it2;
int main() {
  int x, y;
  for (int i = 0; i < (8); ++i) {
    scanf("%d%d", &x, &y);
    in[i][0] = x;
    in[i][1] = y;
    if (!sx.count(x)) sx.insert(x);
    if (!sy.count(y)) sy.insert(y);
  }
  if ((int)sx.size() != 3 || (int)sy.size() != 3)
    printf("%s\n", "ugly");
  else {
    int mat[5][5];
    memset(mat, 0, sizeof(mat));
    int cnt = 0, f = 1;
    map<int, int> xx, yy;
    for (__typeof((sx).begin()) it1 = (sx).begin(); it1 != (sx).end(); it1++)
      xx[(*it1)] = cnt++;
    cnt = 0;
    for (__typeof((sy).begin()) it2 = (sy).begin(); it2 != (sy).end(); it2++)
      yy[(*it2)] = cnt++;
    for (int i = 0; i < (8); ++i) mat[xx[in[i][0]]][yy[in[i][1]]] = 1;
    for (int i = 0; i < (3); ++i) {
      for (int j = 0; j < (3); ++j) {
        if (i == 1 && j == 1 && mat[i][j]) f = 0;
        if ((i != 1 || j != 1) && !mat[i][j]) f = 0;
      }
    }
    if (f)
      printf("%s\n", "respectable");
    else
      printf("%s\n", "ugly");
  }
}
