#include <bits/stdc++.h>
using namespace std;
int num1[1500000], vis[1500000], num2[1500000], vis1[1500000];
int se[1500000][2];
int main() {
  int i, j;
  int x, y;
  map<int, int> ma;
  memset(vis, 0, sizeof(vis));
  memset(vis1, 0, sizeof(vis1));
  int ans1 = 0, ans2 = 0;
  for (i = 0; i <= 7; i++) {
    scanf("%d %d", &x, &y);
    se[i][0] = x, se[i][1] = y;
    if (!vis[x]) vis[x] = 1, num1[ans1++] = x;
    if (!vis1[y]) vis1[y] = 1, num2[ans2++] = y;
  }
  if (ans1 != 3 || ans2 != 3) {
    printf("ugly\n");
    return 0;
  }
  sort(num1, num1 + 3);
  sort(num2, num2 + 3);
  int flag = 0;
  for (i = 0; i < ans1; i++) {
    int temp = 0;
    memset(vis, 0, sizeof(vis));
    for (j = 0; j <= 7; j++) {
      if (se[j][0] == num1[1] && se[j][1] == num2[1]) flag = 1;
      if (se[j][0] == num1[i] && vis[se[j][1]] == 0) {
        temp++;
        vis[se[j][1]] = 1;
      }
    }
    if (flag == 1) break;
    if ((i == 0 || i == 2) && temp == 3)
      continue;
    else if (i == 1 && temp == 2)
      continue;
    else
      break;
  }
  if (i < ans1)
    printf("ugly\n");
  else
    printf("respectable\n");
  return 0;
}
