#include <bits/stdc++.h>
using namespace std;
struct dat {
  int nx, ny;
} ans[9];
bool cmp(dat p, dat q) {
  if (p.nx != q.nx)
    return p.nx < q.nx;
  else
    return p.ny < q.ny;
}
int main() {
  for (int i = 1; i <= 8; i++) scanf("%d %d", &ans[i].nx, &ans[i].ny);
  sort(ans + 1, ans + 9, cmp);
  int sum1 = 0, sum2 = 0, sum3 = 0;
  if (ans[1].nx == ans[1].ny) sum3++;
  for (int i = 2; i <= 8; i++) {
    if (ans[i].nx != ans[i - 1].nx) sum1++;
    if (ans[i].ny != ans[i - 1].ny) sum2++;
    if (ans[i].nx == ans[i].ny) sum3++;
  }
  if (sum1 == 2 && sum2 == 7) {
    if (ans[1].nx == ans[2].nx && ans[3].nx == ans[1].nx &&
        ans[3].ny == ans[5].ny && ans[5].ny == ans[8].ny &&
        ans[8].nx == ans[7].nx && ans[7].nx == ans[6].nx &&
        ans[1].ny == ans[4].ny && ans[4].ny == ans[6].ny &&
        ans[2].ny == ans[7].ny && ans[2].nx != ans[7].nx &&
        ans[5].nx == ans[4].nx && ans[5].ny != ans[4].ny)
      puts("respectable");
    else
      puts("ugly");
  } else
    puts("ugly");
  return 0;
}
