#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0)
    return (b);
  else
    return (gcd(b % a, a));
}
long long int fastpow(long long int a, long long int n, long long int temp) {
  if (n == 0) return (1);
  if (n == 1) return ((a * temp) % 1000000007);
  if (n & 1) temp = (temp * a) % 1000000007;
  return (fastpow((a * a) % 1000000007, n / 2, temp));
}
char dum;
long long int a[200005];
int main() {
  map<int, int> x, y;
  map<int, int>::iterator it1, it2;
  vector<pair<int, int> > p;
  int x1, y1;
  for (int i = 0; i < 8; i++) {
    scanf("%d", &x1), scanf("%d", &y1);
    x[x1] = 1, y[y1] = 1;
    p.push_back(make_pair(x1, y1));
  }
  sort(p.begin(), p.end());
  if (x.size() != 3 or y.size() != 3) {
    printf("ugly\n");
    return (0);
  }
  vector<int> v1, v2;
  vector<pair<int, int> > v;
  for (it1 = x.begin(); it1 != x.end(); it1++) v1.push_back(it1->first);
  for (it1 = y.begin(); it1 != y.end(); it1++) v2.push_back(it1->first);
  for (int i = 0; i < v1.size(); i++) {
    for (int j = 0; j < v2.size(); j++) {
      if (i == 1 and j == 1) continue;
      v.push_back(make_pair(v1[i], v2[j]));
    }
  }
  if (v != p) {
    printf("ugly\n");
    return (0);
  }
  printf("respectable\n");
  return (0);
}
