#include <bits/stdc++.h>
using namespace std;
int main() {
  long arrX[8];
  long arrY[8];
  map<long, int> X, Y;
  map<long, int>::iterator it, it1;
  for (int i = 0; i < 8; ++i) {
    cin >> arrX[i] >> arrY[i];
    X[arrX[i]]++;
    Y[arrY[i]]++;
  }
  if (X.size() != 3 || Y.size() != 3)
    cout << "ugly" << endl;
  else {
    bool b = true;
    it = X.begin();
    for (auto it2 = Y.begin(); it2 != Y.end(); ++it2) {
      bool found = false;
      for (int i = 0; i < 8; ++i) {
        if (it->first == arrX[i] && it2->first == arrY[i]) found = true;
      }
      if (!found) {
        b = false;
        break;
      }
    }
    if (!b)
      cout << "ugly" << endl;
    else {
      it = X.begin();
      it++;
      it1 = Y.begin();
      it1++;
      bool sy;
      bool tanya = true;
      for (auto it2 = Y.begin(); it2 != Y.end(); ++it2) {
        bool found = false;
        if (it2 == it1)
          sy = true;
        else
          sy = false;
        for (int i = 0; i < 8; ++i) {
          if (sy) found = true;
          if (sy && it->first == arrX[i] && it2->first == arrY[i])
            tanya = false;
          else if (it->first == arrX[i] && it2->first == arrY[i])
            found = true;
        }
        if (!found || !tanya) {
          b = false;
          break;
        }
      }
      if (!b)
        cout << "ugly" << endl;
      else {
        it = X.begin();
        it++;
        it++;
        bool tanya = true;
        for (auto it2 = Y.begin(); it2 != Y.end(); ++it2) {
          bool found = false;
          for (int i = 0; i < 8; ++i) {
            if (it->first == arrX[i] && it2->first == arrY[i]) found = true;
          }
          if (!found) {
            b = false;
            break;
          }
        }
        if (!b)
          cout << "ugly" << endl;
        else
          cout << "respectable" << endl;
      }
      return 0;
    }
  }
}
