#include <bits/stdc++.h>
using namespace std;
int main() {
  set<int> s1, s2;
  set<pair<int, int> > s3;
  for (int i = 0; i < 8; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    s1.insert(x);
    s2.insert(y);
    s3.insert(pair<int, int>(x, y));
  }
  if (s1.size() != 3 || s2.size() != 3) {
    puts("ugly");
    return 0;
  } else {
    set<int>::iterator it1 = s1.begin();
    for (int i = 0; i < 3; i++, it1++) {
      set<int>::iterator it2 = s2.begin();
      for (int j = 0; j < 3; j++, it2++) {
        int x = (*it1);
        int y = (*it2);
        if (i == 1 && j == 1) {
          if (s3.find(pair<int, int>(x, y)) != s3.end()) {
            puts("ugly");
            return 0;
          }
        } else if (s3.find(pair<int, int>(x, y)) == s3.end()) {
          puts("ugly");
          return 0;
        }
      }
    }
  }
  puts("respectable");
  return 0;
}
