#include <bits/stdc++.h>
using namespace std;
int x[10], y[10];
set<pair<int, int> > s;
vector<int> v;
int main(void) {
  int i;
  int x1, x2, x3;
  int y1, y2, y3;
  for (i = 0; i < 8; i++) scanf("%d %d", &x[i], &y[i]);
  for (i = 0; i < 8; i++) {
    s.insert(make_pair(x[i], y[i]));
    v.push_back(x[i]);
    v.push_back(y[i]);
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  for (x1 = 0; x1 + 2 < (signed)v.size(); x1++)
    for (x2 = x1 + 1; x2 + 1 < (signed)v.size(); x2++)
      for (x3 = x2 + 1; x3 < (signed)v.size(); x3++)
        for (y1 = 0; y1 + 2 < (signed)v.size(); y1++)
          for (y2 = y1 + 1; y2 + 1 < (signed)v.size(); y2++)
            for (y3 = y2 + 1; y3 < (signed)v.size(); y3++)
              if (s.count(make_pair(v.at(x1), v.at(y1))) &&
                  s.count(make_pair(v.at(x1), v.at(y2))) &&
                  s.count(make_pair(v.at(x1), v.at(y3))) &&
                  s.count(make_pair(v.at(x2), v.at(y1))) &&
                  s.count(make_pair(v.at(x2), v.at(y3))) &&
                  s.count(make_pair(v.at(x3), v.at(y1))) &&
                  s.count(make_pair(v.at(x3), v.at(y2))) &&
                  s.count(make_pair(v.at(x3), v.at(y3)))) {
                puts("respectable");
                return 0;
              }
  puts("ugly");
  return 0;
}
