#include <bits/stdc++.h>
const int N = 100005;
const int inf = 1 << 28;
const double eps = 1e-8;
using namespace std;
int x[10], y[10];
int a[10], b[10];
bool judge() {
  sort(a, a + 8);
  sort(b, b + 8);
  int nx = unique(a, a + 8) - a;
  int ny = unique(b, b + 8) - b;
  if (nx != 3 || ny != 3) return 0;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (i == 1 && j == 1) continue;
      int k;
      for (k = 0; k < 8; k++) {
        if (x[k] == a[i] && y[k] == b[j]) break;
      }
      if (k == 8) return 0;
    }
  }
  return 1;
}
int main() {
  int n;
  while (scanf("%d%d", &x[0], &y[0]) > 0) {
    a[0] = x[0], b[0] = y[0];
    for (int i = 1; i < 8; i++) {
      scanf("%d%d", &x[i], &y[i]);
      a[i] = x[i], b[i] = y[i];
    }
    if (judge())
      puts("respectable");
    else
      puts("ugly");
  }
  return 0;
}
