#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const int INF = 1000 * 1000 * 1000;
pair<long long int, long long int> P[10];
bool can(pair<long long int, long long int> A,
         pair<long long int, long long int> B,
         pair<long long int, long long int> C) {
  long long int X = A.first - B.first;
  long long int Y = A.second - B.second;
  long long int X2 = A.first - C.first;
  long long int Y2 = A.second - C.second;
  long long int ans = (Y * X2 - X * Y2);
  return ans == 0;
}
bool XT[1000009], YT[1000009];
long long int dist(pair<long long int, long long int> A,
                   pair<long long int, long long int> B) {
  return ((((A.first - B.first)) * ((A.first - B.first))) +
          ((A.second - B.second) * (A.second - B.second)));
}
int main() {
  int N, x, y;
  set<pair<long long int, long long int> > Ps;
  bool resp = true;
  memset(XT, false, sizeof XT);
  memset(YT, false, sizeof YT);
  int cnt1 = 0, cnt2 = 0;
  for (int i = 1; i <= 8; i++) {
    cin >> x >> y;
    if (XT[x] == false) cnt1++;
    if (YT[y] == false) cnt2++;
    Ps.insert(pair<long long int, long long int>(x, y));
    XT[x] = YT[y] = true;
    P[i].first = x;
    P[i].second = y;
  }
  if (cnt1 != 3 || cnt2 != 3 || Ps.size() != 8) resp = false;
  sort(P + 1, P + 9);
  if (!can(P[1], P[3], P[2]) || !can(P[3], P[8], P[5]) ||
      !can(P[8], P[6], P[7]) || !can(P[1], P[6], P[4]))
    resp = false;
  if (resp)
    cout << "respectable" << endl;
  else
    cout << "ugly" << endl;
  return 0;
}
