#include <bits/stdc++.h>
typedef struct {
  int x, y;
} SP;
using namespace std;
SP pa[15];
int x[10];
int y[10];
int cmp(const void *a, const void *b) {
  int x = *((int *)a);
  int y = *((int *)b);
  return x - y;
}
int main(void) {
  map<int, int> sn;
  map<int, int> sy;
  sy.clear();
  sn.clear();
  int co[3][3];
  memset(co, 0, sizeof(co));
  int i, j, k;
  int xn = 0;
  int yn = 0;
  for (i = 0; i < 8; i++) {
    scanf("%d %d", &pa[i].x, &pa[i].y);
    if (sn[pa[i].x] == 0) {
      x[xn++] = pa[i].x;
      sn[pa[i].x] = 1;
    }
    if (sy[pa[i].y] == 0) {
      y[yn++] = pa[i].y;
      sy[pa[i].y] = 1;
    }
  }
  qsort(x, xn, sizeof(x[0]), cmp);
  qsort(y, yn, sizeof(y[0]), cmp);
  int yes = 1;
  for (i = 0; i < 3; i++)
    for (j = 0; j < 3; j++)
      if (!(i == 1 && j == 1)) {
        for (k = 0; k < 8; k++)
          if (pa[k].x == x[i] && pa[k].y == y[j]) {
            co[i][j] = 1;
          }
        if (co[i][j] == 0) {
          yes = 0;
        }
      }
  if (xn != 3 || yn != 3) yes = 0;
  if (yes == 1)
    printf("respectable\n");
  else
    printf("ugly\n");
  return 0;
}
