#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INFI = 1e9;
const int N = 9;
const int M = 1111;
const int move[8][2] = {1, 0, -1, 0, 0, 1, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
struct point {
  int x, y;
} p[N];
bool cmp(point a, point b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
bool fun() {
  if (p[0].x != p[1].x || p[1].x != p[2].x) return 0;
  if (p[0].y == p[1].y || p[1].y == p[2].y) return 0;
  if (p[3].x != p[4].x || p[3].x == p[2].x) return 0;
  if (p[3].y != p[0].y || p[4].y != p[2].y) return 0;
  if (p[5].x != p[6].x || p[6].x != p[7].x) return 0;
  if (p[5].y != p[0].y || p[6].y != p[1].y || p[7].y != p[2].y) return 0;
  return 1;
}
int main() {
  for (int i = 0; i < 8; i++) scanf("%d%d", &p[i].x, &p[i].y);
  sort(p, p + 8, cmp);
  printf("%s\n", fun() ? "respectable" : "ugly");
  return 0;
}
