#include <bits/stdc++.h>
using namespace std;
void solve() {
  vector<long long> x1(8);
  vector<long long> y1(8);
  vector<long long> x;
  vector<long long> y;
  vector<long long> ux = {-1, -1, -1};
  vector<long long> uy = {-1, -1, -1};
  set<long long> xx;
  set<long long> yy;
  set<pair<long long, long long>> st;
  for (long long i = 0; i < 8; i++) {
    cin >> x1[i] >> y1[i];
    x.push_back(x1[i]);
    st.insert(make_pair(x1[i], y1[i]));
    y.push_back(y1[i]);
    xx.insert(x1[i]);
    yy.insert(y1[i]);
  }
  if (st.size() != 8) {
    cout << "ugly" << endl;
    return;
  }
  if (xx.size() != 3 || yy.size() != 3) {
    cout << "ugly" << endl;
    return;
  }
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  for (long long i = 0; i < 8; i++) {
    if (x[i] != ux[0] && x[i] != ux[1] && x[i] != ux[2]) {
      for (long long j = 0; j < 3; j++) {
        if (ux[j] == -1) {
          ux[j] = x[i];
          break;
        }
      }
    }
    if (y[i] != uy[0] && y[i] != uy[1] && y[i] != uy[2]) {
      for (long long j = 0; j < 3; j++) {
        if (uy[j] == -1) {
          uy[j] = y[i];
          break;
        }
      }
    }
  }
  long long ans = 0;
  sort(ux.begin(), ux.end());
  sort(uy.begin(), uy.end());
  vector<long long> xy = {ux[1], uy[1]};
  for (long long i = 0; i < 8; i++) {
    if (x1[i] == ux[0] && y1[i] == uy[0]) {
      ans += 1;
    }
    if (x1[i] == ux[2] && y1[i] == uy[2]) {
      ans += 1;
    }
    if (x1[i] == xy[0] && y1[i] == xy[1]) {
      cout << "ugly" << endl;
      return;
    }
  }
  if (ans != 2) {
    cout << "ugly" << endl;
    return;
  }
  cout << "respectable" << endl;
}
int main() {
  long long t = 1;
  while (t--) {
    solve();
  }
}
