#include <bits/stdc++.h>
using namespace std;
int x[8], y[8];
bool p1[1000001], p2[1000001];
map<int, int> count1;
map<int, int> count2;
bool findxy(int x1, int y1) {
  for (int i = 0; i < 8; i++) {
    if (x1 == x[i] && y1 == y[i]) return true;
  }
  return false;
}
int main() {
  vector<int> save1;
  vector<int> save2;
  for (int i = 0; i < 8; i++) {
    cin >> x[i] >> y[i];
    if (!p1[x[i]]) {
      count1[x[i]] = 0;
      save1.push_back(x[i]);
      p1[x[i]] = true;
    }
    if (!p2[y[i]]) {
      count2[y[i]] = 0;
      save2.push_back(y[i]);
      p2[y[i]] = true;
    }
    count1[x[i]]++;
    count2[y[i]]++;
  }
  sort(save1.begin(), save1.end());
  sort(save2.begin(), save2.end());
  bool resx = true, resy = true;
  if (save1.size() != 3)
    resx = false;
  else if (count1[save1[0]] != 3 || count1[save1[2]] != 3)
    resx = false;
  else if (count1[save1[1]] != 2)
    resx = false;
  if (save2.size() != 3)
    resy = false;
  else if (count2[save2[0]] != 3 || count2[save2[2]] != 3)
    resy = false;
  else if (count2[save2[1]] != 2)
    resy = false;
  if (!resx || !resy)
    cout << "ugly" << endl;
  else if (findxy(save1[1], save2[1]))
    cout << "ugly" << endl;
  else {
    bool Fres = true;
    for (int i = 0; i < save1.size(); i++) {
      for (int j = 0; j < save2.size(); j++) {
        if (i != 1 && j != 1) Fres = findxy(save1[i], save2[j]);
        if (!Fres) break;
      }
      if (!Fres) break;
    }
    if (!Fres)
      cout << "ugly" << endl;
    else
      cout << "respectable" << endl;
  }
  return 0;
}
