#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
int getint(string s) {
  int x = stoi(s);
  return x;
}
string getstring(int x) {
  string lol = to_string(x);
  return lol;
}
bool ok(int x, int gg) { return (x <= gg - 1 and x >= 0); }
int X[4] = {1, 0, -1, 0};
int Y[4] = {0, 1, 0, -1};
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int exponentMod(long long int A, long long int B, long long int C) {
  if (A == 0) return 0;
  if (B == 0) return 1;
  long long int y;
  if (B % 2 == 0) {
    y = exponentMod(A, B / 2, C);
    y = (y * y) % C;
  } else {
    y = A % C;
    y = (y * exponentMod(A, B - 1, C) % C) % C;
  }
  return (long long int)((y + C) % C);
}
bool ispal(string x) {
  for (int i = 0, j = x.size() - 1; i < x.size(); i++, j--) {
    if (i > j) break;
    if (x[j] != x[i]) return false;
  }
  return true;
}
int main() {
  vector<pair<int, int> > v;
  for (int i = 0; i < 8; i++) {
    int x, y;
    cin >> x >> y;
    v.push_back(make_pair(x, y));
  }
  map<pair<int, int>, int> mp;
  set<int> st, st1;
  vector<int> v1, v2;
  for (int i = 0; i < v.size(); i++) {
    mp[v[i]] = 1;
    v1.push_back(v[i].first);
    v2.push_back(v[i].second);
  }
  sort(v1.begin(), v1.end());
  sort(v2.begin(), v2.end());
  v1.erase(unique(v1.begin(), v1.end()), v1.end());
  v2.erase(unique(v2.begin(), v2.end()), v2.end());
  if (v1.size() != 3 || v2.size() != 3) {
    cout << "ugly" << endl;
    return 0;
  }
  int sw = 0;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (i == 1 && j == 1) continue;
      if (!mp[pair<int, int>(v1[i], v2[j])]) {
        cout << "ugly" << endl;
        return 0;
      }
    }
  }
  cout << "respectable" << endl;
}
