#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<pair<int, int> > v;
  vector<pair<int, int> > v1;
  set<int> s1, s2;
  set<int>::iterator it;
  int x, y, x1[3], y1[3], i, j, l1, l2;
  for (i = 0; i < 8; i++) {
    scanf("%d%d", &x, &y);
    v.push_back(make_pair(x, y));
    s1.insert(x);
    s2.insert(y);
  }
  l1 = s1.size();
  l2 = s2.size();
  if (l1 == 3 && l2 == 3) {
    i = 0;
    for (it = s1.begin(); it != s1.end(); it++) x1[i++] = *it;
    i = 0;
    for (it = s2.begin(); it != s2.end(); it++) y1[i++] = *it;
    sort(x1, x1 + 3);
    sort(y1, y1 + 3);
    for (i = 0; i < 3; i++) {
      for (j = 0; j < 3; j++) {
        if (i == 1 && j == 1)
          continue;
        else
          v1.push_back(make_pair(x1[i], y1[j]));
      }
    }
    sort(v.begin(), v.end());
    sort(v1.begin(), v1.end());
    for (i = 0; i < 8; i++) {
      if (v[i].first == v1[i].first && v[i].second == v1[i].second)
        continue;
      else
        break;
    }
    if (i == 8)
      printf("respectable\n");
    else
      printf("ugly\n");
  } else
    printf("ugly\n");
  return 0;
}
