#include <bits/stdc++.h>
using namespace std;
template <class T>
bool inline between(const T& lb, const T& v, const T& ub) {
  return lb <= v && v <= ub;
}
const int INF = int(1E9 + 7);
int main() {
  vector<pair<int, int> > v1, v2;
  set<int> sx, sy;
  int x, y;
  bool good;
  while (scanf("%d %d", &x, &y) != EOF) {
    v1.clear();
    v2.clear();
    sx.clear();
    sy.clear();
    v1.push_back(pair<int, int>(x, y));
    sx.insert(x);
    sy.insert(y);
    for (int i = (0); (i) < int(7); i++) {
      scanf("%d %d", &x, &y);
      v1.push_back(pair<int, int>(x, y));
      sx.insert(x);
      sy.insert(y);
    }
    good = (sx.size() == 3 && sy.size() == 3);
    if (good) {
      int i, j;
      i = 0;
      for (typeof((sx).begin()) it = (sx).begin(); it != (sx).end(); it++) {
        j = 0;
        for (typeof((sy).begin()) it2 = (sy).begin(); it2 != (sy).end();
             it2++) {
          if (i == j && j == 1) {
            j++;
            continue;
          }
          v2.push_back(pair<int, int>(*it, *it2));
          j++;
        }
        i++;
      }
      sort((v1).begin(), (v1).end());
      sort((v2).begin(), (v2).end());
      for (i = 0; i < 8; i++) {
        if (v1[i].first != v2[i].first || v1[i].second != v2[i].second) {
          good = false;
          break;
        }
      }
    }
    puts(good ? "respectable" : "ugly");
  }
  return 0;
}
