#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
} P[8];
int cntx[1000001], cnty[1000001];
vector<int> xset, yset;
int cmp(point a, point b) { return (a.x < b.x) || (a.x == b.x && a.y < b.y); }
int main() {
  int i, j, m = 0, n = 0, l, r, chn[] = {3, 2, 3};
  for (i = 0; i < 8; i++) {
    scanf("%d %d", &P[i].x, &P[i].y);
    if (!cntx[P[i].x]) {
      m++;
      xset.push_back(P[i].x);
    }
    if (!cnty[P[i].y]) {
      n++;
      yset.push_back(P[i].y);
    }
    cntx[P[i].x]++;
    cnty[P[i].y]++;
  }
  sort(xset.begin(), xset.end());
  sort(yset.begin(), yset.end());
  sort(P, P + 8, cmp);
  for (i = 1; i < 8; i++)
    if (P[i].x == P[i - 1].x && P[i].y == P[i - 1].y) break;
  if (m != 3 || n != 3 || i < 8)
    printf("ugly\n");
  else {
    if (cntx[xset[0]] == 3 && cntx[xset[1]] == 2 && cntx[xset[2]] == 3 &&
        cnty[yset[0]] == 3 && cnty[yset[1]] == 2 && cnty[yset[2]] == 3)
      printf("respectable\n");
    else
      printf("ugly\n");
  }
  return 0;
}
