#include <bits/stdc++.h>
using namespace std;
const int MAX = 100 + 10;
pair<int, int> d[MAX];
int main() {
  int i;
  set<int> first, second;
  for ((i) = (1); (i) <= (8); ++(i)) {
    scanf("%d%d", &d[i].first, &d[i].second);
    first.insert(d[i].first);
    second.insert(d[i].second);
  }
  if (first.size() != 3 || second.size() != 3) {
    cout << "ugly" << endl;
    return 0;
  }
  set<int>::iterator a, b;
  for ((a) = (first.begin()); (a) != (first.end()); ++(a))
    for ((b) = (second.begin()); (b) != (second.end()); ++(b)) {
      int flag = 0;
      for ((i) = (1); (i) <= (8); ++(i))
        if (d[i].first == *a && d[i].second == *b) {
          flag = 1;
          break;
        }
      if (a == ++first.begin() && b == ++second.begin()) {
        if (flag) {
          cout << "ugly" << endl;
          return 0;
        }
      } else if (!flag) {
        cout << "ugly" << endl;
        return 0;
      }
    }
  cout << "respectable" << endl;
  return 0;
}
