#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
} s[20];
bool cmp(node a, node b) {
  if (a.x != b.x)
    return a.x < b.x;
  else
    return a.y < b.y;
}
int main() {
  for (int i = 1; i <= 8; i++) {
    scanf("%d %d", &s[i].x, &s[i].y);
  }
  sort(s + 1, s + 8 + 1, cmp);
  int sum1 = 0;
  if (s[1].x == s[2].x && s[1].x == s[3].x) sum1++;
  if ((s[4].x == s[5].x) && s[4].x != s[1].x) sum1++;
  if ((s[6].x != s[4].x) && (s[6].x == s[7].x && s[7].x == s[8].x)) sum1++;
  int sum = 0;
  if (sum1 != 3) {
    printf("ugly\n");
  } else {
    if (s[4].y == s[1].y && s[6].y == s[4].y) sum++;
    if ((s[2].y != s[4].y) && s[2].y == s[7].y) sum++;
    if ((s[2].y != s[3].y) && s[3].y == s[5].y && s[5].y == s[8].y) sum++;
    if (sum != 3)
      printf("ugly\n");
    else
      printf("respectable\n");
  }
  return 0;
}
