#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000007;
template <class T>
T bigmod(T b, T p, T m) {
  if (p == 0) return 1;
  T res = bigmod(b, p / 2, m);
  res = (res * res) % m;
  if (p % 2 == 1) res = (res * b) % m;
  return res;
}
template <class T>
T gcd(T x, T y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
template <typename T>
T POW(T b, T p) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    T s = POW(b, p / 2);
    return s * s;
  }
  return b * POW(b, p - 1);
}
template <typename T>
T ModInv(T b, T m) {
  return bigmod(b, m - 2, m);
}
int main() {
  long long x[10], y[10], f = 1;
  vector<long long> xx, yy;
  map<long long, long long> mpx, mpy;
  map<pair<long long, long long>, long long> mm;
  for (long long i = 0; i < 8; i++) {
    cin >> x[i] >> y[i];
    if (mm[make_pair(x[i], y[i])] == 0)
      mm[make_pair(x[i], y[i])]++;
    else
      f = 0;
    if (mpx[x[i]] == 0) {
      mpx[x[i]]++;
      xx.push_back(x[i]);
    }
    if (mpy[y[i]] == 0) {
      mpy[y[i]]++;
      yy.push_back(y[i]);
    }
  }
  if (xx.size() != 3 || yy.size() != 3 || f == 0) {
    cout << "ugly";
    return 0;
  }
  sort(xx.begin(), xx.end());
  sort(yy.begin(), yy.end());
  long long a, b;
  a = xx[1];
  b = yy[1];
  for (long long i = 0; i < 8; i++) {
    if (a == x[i] && b == y[i]) {
      cout << "ugly";
      return 0;
    }
  }
  cout << "respectable";
  return 0;
}
