#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 40;
const long long inf = 1e16;
void read(int &x) {
  char ch;
  bool flag = 0;
  for (ch = getchar(); !isdigit(ch) && ((flag |= (ch == '-')) || 1);
       ch = getchar())
    ;
  for (x = 0; isdigit(ch); x = (x << 1) + (x << 3) + ch - 48, ch = getchar())
    ;
  x *= 1 - 2 * flag;
}
map<pair<int, int>, bool> mp;
map<int, int> k, p;
int a1[maxn], a2[maxn], t1 = 0, t2 = 0;
int main() {
  int ans = 0;
  for (int i = 0; i < 8; i++) {
    int x, y;
    cin >> x >> y;
    pair<int, int> tmp = make_pair(x, y);
    if (!mp[tmp]) ans++;
    mp[tmp] = 1;
    if (!k[x]) a1[t1++] = x;
    if (!p[y]) a2[t2++] = y;
    k[x] = 1, p[y] = 1;
  }
  if (t1 != 3 || t2 != 3) {
    puts("ugly");
    return 0;
  }
  sort(a1, a1 + t1), sort(a2, a2 + t2);
  pair<int, int> tmp = make_pair(a1[1], a2[1]);
  if (mp[tmp] || ans != 8)
    puts("ugly");
  else
    puts("respectable");
  return 0;
}
