#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
static inline int Rint() {
  struct X {
    int dig[256];
    X() {
      for (int i = '0'; i <= '9'; ++i) dig[i] = 1;
      dig['-'] = 1;
    }
  };
  static X fuck;
  int s = 1, v = 0, c;
  for (; !fuck.dig[c = getchar()];)
    ;
  if (c == '-')
    s = 0;
  else if (fuck.dig[c])
    v = c ^ 48;
  for (; fuck.dig[c = getchar()]; v = v * 10 + (c ^ 48))
    ;
  return s ? v : -v;
}
template <typename T>
static inline void cmax(T& a, const T& b) {
  if (b > a) a = b;
}
template <typename T>
static inline void cmin(T& a, const T& b) {
  if (b < a) a = b;
}
const int maxn = 100005;
map<pair<int, int>, int> mem;
set<int> X, Y;
int check() {
  if (((int)(X).size()) != 3) return 0;
  if (((int)(Y).size()) != 3) return 0;
  vector<int> u(X.begin(), X.end());
  vector<int> v(Y.begin(), Y.end());
  for (int i = 0; i < 3; ++i)
    for (int j = 0; j < 3; ++j) {
      if (i == 1 && j == 1) continue;
      const int x = u[i], y = v[j];
      if (mem.count({x, y}) != 1) return 0;
    }
  return 1;
}
int main() {
  for (int i = 0; i < 8; ++i) {
    const int x = Rint(), y = Rint();
    X.insert(x);
    Y.insert(y);
    mem[{x, y}] = 1;
  }
  puts(check() ? "respectable" : "ugly");
  return 0;
}
