#include <bits/stdc++.h>
using namespace std;
const long maxV = (long)1E6 + 1;
int dx[maxV + 1], dy[maxV + 1];
pair<long, long> p[8];
long xx[3], yy[3];
bool flag[3][3];
int main() {
  int cx = 0, cy = 0;
  for (int i = 0; i < 8; ++i) {
    scanf("%ld %ld", &p[i].first, &p[i].second);
    if (dx[p[i].first] == 0) {
      ++cx;
      if (cx > 3) {
        printf("ugly\n");
        return 0;
      }
      xx[cx - 1] = p[i].first;
    }
    if (dy[p[i].second] == 0) {
      ++cy;
      if (cy > 3) {
        printf("ugly\n");
        return 0;
      }
      yy[cy - 1] = p[i].second;
    }
    ++dx[p[i].first];
    ++dy[p[i].second];
  }
  if (cx != 3 || cy != 3) {
    printf("ugly\n");
    return 0;
  }
  sort(xx, xx + 3);
  sort(yy, yy + 3);
  memset(flag, false, sizeof flag);
  for (int i = 0; i < 8; ++i) {
    for (int j = 0; j < 3; ++j)
      for (int k = 0; k < 3; ++k)
        if (j == 1 && k == 1) {
          if (p[i].first == xx[j] && p[i].second == yy[k]) {
            printf("ugly\n");
            return 0;
          }
        } else if (p[i].first == xx[j] && p[i].second == yy[k])
          flag[j][k] = true;
  }
  for (int j = 0; j < 3; ++j)
    for (int k = 0; k < 3; ++k)
      if (j != 1 || k != 1)
        if (!flag[j][k]) {
          printf("ugly\n");
          return 0;
        }
  printf("respectable\n");
  return 0;
}
