#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const int N = 2500005;
inline int read() {
  int x = 0, k = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') k = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return x * k;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
map<int, int> mp;
struct node {
  int a, b;
  bool operator<(const node& rhs) const {
    if (a == rhs.a) return b < rhs.b;
    return a < rhs.a;
  }
} nod[10];
int main() {
  ios::sync_with_stdio(false);
  int i, j;
  int flag = 0;
  for (i = 0; i < 8; i++) {
    cin >> nod[i].a >> nod[i].b;
    mp[nod[i].a]++;
  }
  sort(nod, nod + 8);
  if (nod[0].a == nod[1].a && nod[1].a == nod[2].a && nod[0].b < nod[1].b &&
      nod[1].b < nod[2].b) {
    if (nod[3].a == nod[4].a && nod[4].a != nod[5].a && nod[3].b < nod[4].b) {
      if (nod[3].b == nod[0].b && nod[4].b == nod[2].b) {
        if (nod[5].a == nod[6].a && nod[6].a == nod[7].a &&
            nod[5].b == nod[0].b && nod[6].b == nod[1].b &&
            nod[7].b == nod[2].b) {
          cout << "respectable" << endl;
          return 0;
        } else {
          cout << "ugly" << endl;
          return 0;
        }
      } else {
        cout << "ugly" << endl;
        return 0;
      }
    } else {
      cout << "ugly" << endl;
      return 0;
    }
  } else {
    cout << "ugly" << endl;
    return 0;
  }
  return 0;
}
