#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1}, dy[] = {0, -1, 0, 1, -1, -1, 1, 1};
int kx[] = {2, 1, -1, -2, -2, -1, 1, 2}, ky[] = {1, 2, 2, 1, -1, -2, -2, -1};
bool isVowel(char ch) {
  ch = tolower(ch);
  return ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
}
long long bigmod(long long B, long long P, long long M) {
  long long R = 1;
  while (P > 0) {
    if (P % 2) {
      R = (R * B) % M;
    }
    P /= 2;
    B = (B * B) % M;
  }
  return (int)R;
}
long long nCr(double n, double r) {
  double ans = 1;
  if (r > n - r) r = n - r;
  for (int i = 1; i <= r; i++) {
    ans *= (n - i + 1);
    ans /= i;
  }
  return (long long)ans;
}
string toString(int n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
int toInt(string s) {
  int r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
int POW(int b, int p) {
  int r = 1;
  for (int i = 1; i <= p; i++) r *= b;
  return r;
}
struct info {
  int x, y;
} p[8], t;
vector<info> ans;
bool cmp(info a, info b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
bool fx[1000007], fy[1000007];
int main() {
  vector<int> vx, vy;
  for (int i = 0; i < 8; i++) {
    cin >> p[i].x >> p[i].y;
    if (!fx[p[i].x]) vx.push_back(p[i].x);
    fx[p[i].x] = 1;
    if (!fy[p[i].y]) vy.push_back(p[i].y);
    fy[p[i].y] = 1;
  }
  sort(p, p + 8, cmp);
  sort(vx.begin(), vx.end());
  sort(vy.begin(), vy.end());
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (i == 1 && j == 1) continue;
      t.x = vx[i], t.y = vy[j];
      ans.push_back(t);
    }
  }
  sort(ans.begin(), ans.end(), cmp);
  for (int i = 0; i < 8; i++) {
    if (p[i].x != ans[i].x || p[i].y != ans[i].y) {
      cout << "ugly" << endl;
      return 0;
    }
  }
  cout << "respectable" << endl;
  return 0;
}
