#include <bits/stdc++.h>
using namespace std;
struct hrtac {
  int x, y;
} d[10];
bool cmp(hrtac a, hrtac b) { return a.x == b.x ? a.y < b.y : a.x < b.x; }
bool cmp1(hrtac a, hrtac b) { return a.x < b.x; }
bool cmp2(hrtac a, hrtac b) { return a.y < b.y; }
void print() {
  puts("");
  for (int i = 1; i <= 8; i++) {
    printf("%d %d\n", d[i].x, d[i].y);
  }
}
int x[10], y[10];
int main() {
  for (int i = 1; i <= 8; i++) {
    scanf("%d%d", &d[i].x, &d[i].y);
  }
  d[0].x = d[0].y = 19260817;
  sort(d + 1, d + 9, cmp1);
  int cntx = 0, cnty = 0;
  for (int i = 1; i < 9; i++) {
    if (d[i].x != d[i - 1].x) cntx++, x[cntx] = d[i].x;
  }
  if (cntx != 3) {
    puts("ugly");
    return 0;
  }
  sort(d + 1, d + 9, cmp2);
  for (int i = 1; i < 9; i++) {
    if (d[i].y != d[i - 1].y) cnty++, y[cnty] = d[i].y;
  }
  if (cnty != 3) {
    puts("ugly");
    return 0;
  }
  sort(d + 1, d + 9, cmp);
  int tmp = 0;
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= 3; j++) {
      if (i == 2 && j == 2) continue;
      tmp++;
      if (x[i] != d[tmp].x || y[j] != d[tmp].y) {
        printf("ugly");
        return 0;
      }
    }
  }
  puts("respectable");
  return 0;
}
