#include <bits/stdc++.h>
using namespace std;
const int inf = 1000 * 2000 * 1000, MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1000 * 1LL * 1000000 * 1000 * 1000000;
int cntx[1100010], cnty[1100010];
struct qwe {
  int x, y;
};
qwe a[9];
vector<int> vecx, vecy;
bool wasx[1000100], wasy[1000100];
map<int, map<int, bool> > u, u2;
int main() {
  srand(time(NULL));
  for (int i = 1; i <= 8; i++) {
    cin >> a[i].x >> a[i].y;
    u[a[i].x][a[i].y] = 1;
    if (!wasx[a[i].x]) {
      vecx.push_back(a[i].x);
      wasx[a[i].x] = 1;
    }
    if (!wasy[a[i].y]) {
      vecy.push_back(a[i].y);
      wasy[a[i].y] = 1;
    }
  }
  if (vecx.size() != 3) {
    cout << "ugly";
    return 0;
  }
  if (vecy.size() != 3) {
    cout << "ugly";
    return 0;
  }
  sort(vecx.begin(), vecx.end());
  sort(vecy.begin(), vecy.end());
  for (int i = 0; i < vecx.size(); i++) {
    for (int j = 0; j < vecy.size(); j++) {
      if (i == j && i == 1) {
        continue;
      }
      if (!u[vecx[i]][vecy[j]]) {
        cout << "ugly";
        return 0;
      }
      u2[vecx[i]][vecy[j]] = 1;
    }
  }
  for (int i = 1; i <= 8; i++) {
    if (!u2[a[i].x][a[i].y]) {
      cout << "ugly";
      return 0;
    }
  }
  cout << "respectable";
  return 0;
}
