#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> p[8];
set<pair<long long, long long> > s;
set<int> sx, sy;
bool check() {
  if (sx.size() != 3 || sy.size() != 3) return false;
  for (set<int>::iterator i = sx.begin(); i != sx.end(); i++) {
    for (set<int>::iterator j = sy.begin(); j != sy.end(); j++) {
      set<int>::iterator px = i;
      set<int>::iterator py = j;
      px--, py--;
      if (px != sx.begin() || py != sy.begin())
        if (s.find(make_pair(*i, *j)) == s.end()) return false;
    }
  }
  return true;
}
int main() {
  int x, y;
  for (int i = 0; i < 8; i++) {
    cin >> x >> y;
    sx.insert(x);
    sy.insert(y);
    s.insert(make_pair(x, y));
  }
  if (check())
    cout << "respectable\n";
  else
    cout << "ugly\n";
  return 0;
}
