#include <bits/stdc++.h>
using namespace std;
int x[14], y[14];
int b1[14], b2[14], mp[11][11];
int main() {
  int i, a, b, l1, l2;
  for (i = 0; i < 8; i++) {
    scanf("%d%d", &a, &b);
    x[i] = a;
    y[i] = b;
    b1[i] = a;
    b2[i] = b;
  }
  sort(b1, b1 + 8);
  l1 = unique(b1, b1 + 8) - b1;
  sort(b2, b2 + 8);
  l2 = unique(b2, b2 + 8) - b2;
  if (l1 != 3 || l2 != 3)
    printf("ugly\n");
  else {
    for (i = 0; i < 8; i++) x[i] = lower_bound(b1, b1 + l1, x[i]) - b1 + 1;
    for (i = 0; i < 8; i++) y[i] = lower_bound(b2, b2 + l2, y[i]) - b2 + 1;
    for (i = 0; i < 8; i++) mp[x[i]][y[i]] = 1;
    int re = 0;
    for (i = 1; i < 4 && !re; i++)
      for (int j = 1; j < 4; j++) {
        if (i == 2 && j == 2) continue;
        if (!mp[i][j]) {
          re = 1;
          break;
        }
      }
    if (re)
      printf("ugly\n");
    else
      printf("respectable\n");
  }
  return 0;
}
