#include <bits/stdc++.h>   using namespace std;   const int okX[] = {0, 0, 0, 1, 1, 2, 2, 2};   const int okY[] = {0, 1, 2, 0, 2, 0, 1, 2};   const int n = 8;   void normalize(int a[n]) {     vector<int> v(a, a + n);     sort(v.begin(), v.end());     map<int, int> m;     for (int i = 0; i < v.size(); ++i)       if (!m.count(v[i])) m.insert(make_pair(v[i], m.size()));     for (int i = 0; i < 8; ++i) a[i] = m[a[i]];   }   int main() {     int x[n], y[n];     for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];     normalize(x);     normalize(y);     bool used[n];     memset(used, false, sizeof(used));     for (int i = 0; i < 8; ++i) {       bool ok = false;       for (int j = 0; j < 8; ++j)         if (x[i] == okX[j] && y[i] == okY[j] && !used[j])           ok = true, used[j] = true;       if (!ok) {         printf( ugly n );         return 0;       }     }     printf( respectable n );     return 0;   }   