#include <bits/stdc++.h>
using namespace std;
struct predx {
  bool operator()(pair<int, int> p1, pair<int, int> p2) {
    return p1.first < p2.first;
  }
};
struct predy {
  bool operator()(pair<int, int> p1, pair<int, int> p2) {
    return p1.second < p2.second;
  }
};
int main() {
  int x, y;
  vector<pair<int, int> > v;
  vector<pair<int, int> > vpx;
  vector<pair<int, int> > vpy;
  for (int i = 0; i < 8; ++i) {
    cin >> x >> y;
    v.push_back(make_pair(x, y));
    vpx.push_back(make_pair(x, y));
    vpy.push_back(make_pair(x, y));
  }
  sort(vpx.begin(), vpx.end(), predx());
  sort(vpy.begin(), vpy.end(), predy());
  vector<vector<int> > vx;
  vector<vector<int> > vy;
  for (int nbeg = 0; nbeg < 8; ++nbeg) {
    for (int nend = 7; nend > 0; --nend) {
      for (int nmid = nbeg + 1; nmid < nend; ++nmid) {
        if (vpx[nbeg].first < vpx[nmid].first &&
            vpx[nmid].first < vpx[nend].first) {
          vector<int> tempx;
          tempx.push_back(vpx[nbeg].first);
          tempx.push_back(vpx[nmid].first);
          tempx.push_back(vpx[nend].first);
          vx.push_back(tempx);
          tempx.clear();
        }
        if (vpy[nbeg].second < vpy[nmid].second &&
            vpy[nmid].second < vpy[nend].second) {
          vector<int> tempy;
          tempy.push_back(vpy[nbeg].second);
          tempy.push_back(vpy[nmid].second);
          tempy.push_back(vpy[nend].second);
          vy.push_back(tempy);
          tempy.clear();
        }
      }
    }
  }
  sort(v.begin(), v.end());
  for (int ix = 0; ix < vx.size(); ++ix) {
    for (int iy = 0; iy < vy.size(); ++iy) {
      if (binary_search(v.begin(), v.end(), make_pair(vx[ix][0], vy[iy][0])) &&
          !binary_search(v.begin(), v.end(), make_pair(vx[ix][1], vy[iy][1])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][2], vy[iy][2])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][0], vy[iy][1])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][0], vy[iy][2])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][1], vy[iy][0])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][1], vy[iy][2])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][2], vy[iy][0])) &&
          binary_search(v.begin(), v.end(), make_pair(vx[ix][2], vy[iy][1]))) {
        cout << "respectable";
        return 0;
      }
    }
  }
  cout << "ugly";
  return 0;
}
