#include <bits/stdc++.h>
using namespace std;
const long long int N = 100005;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  {
    long long int i, j, k, n, m, l, r, ans = 0, cnt = 0, sum = 0;
    vector<pair<long long int, long long int>> v;
    for (i = 0; i < 8; i++) {
      cin >> j >> k;
      v.push_back(make_pair(j, k));
    }
    sort((v).begin(), (v).end());
    map<long long int, long long int> x, y;
    for (long long int i = (long long int)(0); i < (long long int)(v.size());
         i++) {
      j = v[i].first;
      k = v[i].second;
      if (x[j] == 0) {
        x[j]++;
        cnt++;
      } else {
        x[j]++;
      }
      if (y[k] == 0) {
        y[k]++;
        sum++;
      } else {
        y[k]++;
      }
    }
    l = v[3].first;
    r = v[1].second;
    if (cnt > 3 || sum > 3 || cnt < 3 || sum < 3) {
      cout << "ugly" << endl;
      return 0;
    }
    if (x[v[3].first] > 2) {
      cout << "ugly" << endl;
      return 0;
    }
    for (long long int i = (long long int)(0);
         i < (long long int)(v.size() - 1); i++) {
      if (v[i].first == v[i + 1].first && v[i].second == v[i + 1].second) {
        cout << "ugly" << endl;
        return 0;
      }
    }
    for (long long int i = (long long int)(3); i < (long long int)(6); i++) {
      if (v[i].first == l && v[i].second == r) {
        cout << "ugly" << endl;
        return 0;
      }
    }
    cout << "respectable" << endl;
    return 0;
  }
}
