#include <bits/stdc++.h>
using namespace std;
long long int M = 1000000007;
long long int min(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[0];
}
long long int max(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[3];
}
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    int temp = a;
    a = b;
    b = temp;
  }
  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));
}
vector<long long int> getprimes() {
  vector<long long int> pl(101, 1);
  for (int i = 2; i <= 100; i++) {
    if (pl[i] == 1) {
      for (int j = 2 * i; j <= 100; j += i) {
        pl[j] = 0;
      }
    }
  }
  return pl;
}
double distsqrd(double x1, double y1, double x2, double y2) {
  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
}
long long int fact(long long int first) {
  long long int ans = 1;
  if (first == 0) {
    return 1;
  }
  while (first > 0) {
    ans = (ans * first) % 1000000007;
    first--;
  }
  return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans % M;
    }
    b /= 2;
    a *= a;
    a = a % M;
  }
  return ans % M;
}
long long int mod(long long int a, long long int b) {
  return (((a % b) + b) % b);
}
vector<int> getbinary(int first) {
  vector<int> bin(16, 0);
  int iter = 0;
  while (first > 0) {
    if (first % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    first /= 2;
  }
  return bin;
}
struct aim {
  double first, second, p, t;
};
bool comparator(const aim &a, const aim &b) { return a.t < b.t; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  pair<int, int> a[8];
  map<pair<int, int>, int> m;
  set<int> s1, s2;
  for (int i = 0; i < 8; i++) {
    cin >> a[i].first >> a[i].second;
    s1.insert(a[i].first);
    s2.insert(a[i].second);
    m[a[i]] = 1;
  }
  if (s1.size() != 3 || s2.size() != 3) {
    cout << "ugly\n";
    return 0;
  } else {
    int x1, x2, x3 = 0, y1, y2, y3 = 0;
    for (auto e : s1) {
      if (x3 == 0) {
        x1 = e;
      } else if (x3 == 1) {
        x2 = e;
      } else {
        x3 = e;
        break;
      }
      x3++;
    }
    for (auto e : s2) {
      if (y3 == 0) {
        y1 = e;
      } else if (y3 == 1) {
        y2 = e;
      } else {
        y3 = e;
        break;
      }
      y3++;
    }
    if (m[make_pair(x2, y2)] == 1 || m[make_pair(x1, y1)] == 0 ||
        m[make_pair(x1, y2)] == 0 || m[make_pair(x1, y3)] == 0 ||
        m[make_pair(x2, y1)] == 0 || m[make_pair(x2, y3)] == 0 ||
        m[make_pair(x3, y1)] == 0 || m[make_pair(x3, y2)] == 0 ||
        m[make_pair(x3, y3)] == 0) {
      cout << "ugly\n";
      return 0;
    }
  }
  cout << "respectable\n";
}
