#include <bits/stdc++.h>
using namespace std;
struct node {
  int x;
  int y;
};
map<int, int> mxx;
map<int, int> myy;
node data[9];
int xx[3];
int yy[3];
int main() {
  int flag = 0;
  int a;
  int b;
  int sumx = 0;
  int sumy = 0;
  for (int i = 0; i < 8; ++i) {
    scanf("%d%d", &a, &b);
    if (mxx.count(a) == 0) {
      mxx[a] = 1;
      xx[sumx] = a;
      ++sumx;
    }
    if (myy.count(b) == 0) {
      myy[b] = 1;
      yy[sumy] = b;
      ++sumy;
    }
    data[i].x = a;
    data[i].y = b;
  }
  if (sumx != 3 || sumy != 3) {
    flag = 1;
  }
  if (!flag) {
    sort(xx, xx + 3);
    sort(yy, yy + 3);
    for (int i = 0; i < 3; ++i)
      for (int j = 0; j < 3; ++j) {
        if (i == 1 && j == 1)
          continue;
        else {
          a = 0;
          for (int k = 0; k < 8; ++k) {
            if (data[k].x == xx[i] && data[k].y == yy[j]) {
              a = 1;
              break;
            }
          }
          if (0 == a) flag = 1;
        }
      }
  }
  if (!flag)
    puts("respectable");
  else
    puts("ugly");
  return 0;
}
