#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
  return ((a.first < b.first) || (a.first == b.first && a.second < b.second));
}
int main() {
  vector<pair<int, int> > cur(8);
  set<int> a, b;
  for (int i = 0; i < 8; i++) {
    cin >> cur[i].first >> cur[i].second;
    a.insert(cur[i].first);
    b.insert(cur[i].second);
  }
  sort(cur.begin(), cur.end(), cmp);
  if (a.size() == 3 && b.size() == 3) {
    for (int i = 0; i < 8; i++) {
      if (i < 7) {
        if ((cur[i].first == cur[i + 1].first &&
             cur[i].second == cur[i + 1].second) ||
            (cur[i].first == cur[3].first && cur[i].second == cur[1].second)) {
          cout << "ugly";
          return 0;
        }
      }
    }
    cout << "respectable";
    return 0;
  }
  cout << "ugly";
  return 0;
}
