#include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
const long long mod = 1000 * 1000 * 1000 + 7;
int main() {
  map<int, int> x, y;
  map<pair<int, int>, int> po;
  vector<int> v, vv;
  bool is = 1;
  for (int i = 0; i < 8; i++) {
    int a, b;
    cin >> a >> b;
    x[a]++, y[b]++;
    if (x[a] == 1) v.push_back(a);
    if (y[b] == 1) vv.push_back(b);
    if (x[a] > 3) is = 0;
    if (y[b] > 3) is = 0;
    pair<int, int> u;
    u.first = a, u.second = b;
    po[u]++;
    if (po[u] > 1) is = 0;
  }
  if (is) {
    if ((int)x.size() > 3) is = 0;
    if ((int)y.size() > 3) is = 0;
    if (is) {
      sort((v).begin(), (v).end());
      sort((vv).begin(), (vv).end());
      pair<int, int> o;
      o.first = v[1];
      o.second = vv[1];
      if (po[o] > 0) is = 0;
    }
  }
  if (is)
    cout << "respectable" << endl;
  else
    cout << "ugly" << endl;
  return 0;
}
