#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n = 8;
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    int a1, a2;
    cin >> a1 >> a2;
    v.push_back({a1, a2});
  }
  bool ans = true;
  sort(v.begin(), v.end());
  int x1 = v[0].first;
  int x2 = v[3].first;
  int x3 = v[5].first;
  sort(v.begin(), v.end(), comp);
  int y1 = v[0].second;
  int y2 = v[3].second;
  int y3 = v[5].second;
  if (x1 == x2 || x1 == x3 || x2 == x3) ans = false;
  if (y1 == y2 || y1 == y3 || y2 == y3) ans = false;
  int ct[10];
  memset(ct, 0, sizeof(ct));
  for (int i = 0; i < n; i++) {
    if (v[i].first == x1 && v[i].second == y1) ct[1]++;
    if (v[i].first == x1 && v[i].second == y2) ct[2]++;
    if (v[i].first == x1 && v[i].second == y3) ct[3]++;
    if (v[i].first == x2 && v[i].second == y2) ct[4]++;
    if (v[i].first == x2 && v[i].second == y3) ct[5]++;
    if (v[i].first == x2 && v[i].second == y1) ct[6]++;
    if (v[i].first == x3 && v[i].second == y1) ct[7]++;
    if (v[i].first == x3 && v[i].second == y2) ct[8]++;
    if (v[i].first == x3 && v[i].second == y3) ct[9]++;
  }
  for (int i = 1; i <= 9; i++) {
    if (i != 4 && ct[i] != 1) {
      ans = false;
    } else if (i == 4 && ct[i] != 0) {
      ans = false;
    }
  }
  if (ans)
    cout << "respectable" << endl;
  else
    cout << "ugly" << endl;
}
