#include <bits/stdc++.h>
using namespace std;
int main() {
  pair<int, int> c[10];
  int x[4], y[4], a, b, i, j, k;
  int cntx = 0, cnty = 0;
  for (i = 1; i <= 8; i++) {
    scanf("%d%d", &a, &b);
    c[i] = make_pair(a, b);
    bool tag1 = true;
    bool tag2 = true;
    for (j = 1; j <= cntx; j++)
      if (a == x[j]) tag1 = false;
    for (j = 1; j <= cnty; j++)
      if (b == y[j]) tag2 = false;
    if (tag1) x[++cntx] = a;
    if (tag2) y[++cnty] = b;
  }
  sort(x + 1, x + 4);
  sort(y + 1, y + 4);
  if (cntx != 3) {
    cout << "ugly" << endl;
    return 0;
  }
  if (cnty != 3) {
    cout << "ugly" << endl;
    return 0;
  }
  for (i = 1; i <= 3; i++) {
    for (j = 1; j <= 3; j++) {
      if (i == 2 && j == 2)
        continue;
      else {
        int cnt = 0;
        for (k = 1; k <= 8; k++) {
          if (c[k].first == x[i] && c[k].second == y[j]) cnt++;
        }
        if (cnt != 1) {
          cout << "ugly" << endl;
          return 0;
        }
      }
    }
  }
  cout << "respectable" << endl;
  return 0;
}
