#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<pair<long long int, long long int> > v1(8), v2;
  set<long long int> s1, s2;
  for (int i = 0; i < v1.size(); i++) {
    cin >> v1[i].first >> v1[i].second;
    s1.insert(v1[i].first);
    s2.insert(v1[i].second);
  }
  if (s1.size() != 3 || s2.size() != 3) {
    cout << "ugly";
    return 0;
  }
  vector<long long int> a(s1.begin(), s1.end()), b(s2.begin(), s2.end());
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  int c = 0;
  for (int i = 0; i < a.size(); i++) {
    for (int j = 0; j < b.size(); j++) {
      if (i == 1 && j == 1)
        continue;
      else {
        for (int k = 0; k < v1.size(); k++) {
          if (a[i] == v1[k].first && b[j] == v1[k].second) {
            c++;
            break;
          }
        }
      }
    }
  }
  if (c == 8)
    cout << "respectable";
  else
    cout << "ugly";
}
