#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int size = 3100, mod = 2012, inf = 0x3f3f3f3f;
const long long llmod = 4294967296ll, llinf = 0x3f3f3f3f3f3f3f3fll;
const double pi = acos(-1.0), eps = 1e-8;
int month[2][13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31,
                    0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int nex[2][8] = {-1, 0, 1, 0, -1, 1, 1, -1, 0, 1, 0, -1, 1, 1, -1, -1};
template <class T>
inline void inc(T& a, T b) {
  a = (a + b) % mod;
}
template <class T>
inline T modu(T a) {
  return (a % mod + mod) % mod;
}
template <class T>
inline void crl(T* l, T* r, int step) {
  T tmp = *l;
  for (T* i = l; i < r; i += step) *i = *(i + step);
  *(r - 1) = tmp;
}
template <class T>
inline void crr(T* l, T* r, int step) {
  T tmp = *(r - 1);
  for (T* i = r - 1; i > l; i -= step) *i = *(i - step);
  *l = tmp;
}
bool inline dbeq(double a, double b) { return fabs(a - b) < eps; }
template <class T>
inline void cmin(T& a, T b) {
  a = min(a, b);
}
template <class T>
inline void cmax(T& a, T b) {
  a = max(a, b);
}
int fastMax(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ y; }
int fastMin(int x, int y) { return (((y - x) >> (32 - 1)) & (x ^ y)) ^ x; }
set<pair<int, int> > s;
vector<int> x, y;
int main() {
  int n, a, b;
  bool flag = 1;
  for (int i = 0; i < 8; i++) {
    scanf("%d%d", &a, &b);
    if (s.find(make_pair(a, b)) != s.end()) flag = 0;
    s.insert(make_pair(a, b));
    x.push_back(a);
    y.push_back(b);
  }
  if (flag == 0)
    puts("ugly");
  else {
    sort(x.begin(), x.end()), x.erase(unique(x.begin(), x.end()), x.end());
    sort(y.begin(), y.end()), y.erase(unique(y.begin(), y.end()), y.end());
    if (x.size() != 3 || y.size() != 3 ||
        s.find(make_pair(x[1], y[1])) != s.end())
      puts("ugly");
    else
      puts("respectable");
  }
  return 0;
}
