#include <bits/stdc++.h>
using namespace std;
vector<int> X;
vector<int> Y;
set<pair<int, int> > s;
int main() {
  int x, y, i;
  for (i = 0; i < 8; i++) {
    scanf("%d", &x);
    scanf("%d", &y);
    pair<int, int> a = make_pair(x, y);
    if (s.find(a) != s.end()) {
      cout << "ugly";
      return 0;
    }
    s.insert(a);
    X.push_back(x);
    Y.push_back(y);
  }
  sort(X.begin(), X.end());
  sort(Y.begin(), Y.end());
  if (X[0] == X[1] && X[1] == X[2] && X[3] == X[4] && X[5] == X[6] &&
      X[6] == X[7])
    if (Y[0] == Y[1] && Y[1] == Y[2] && Y[3] == Y[4] && Y[5] == Y[6] &&
        Y[6] == Y[7]) {
      cout << "respectable";
      return 0;
    }
  cout << "ugly";
  return 0;
}
