#include <bits/stdc++.h>   using namespace std;   struct Point {    public:     int x, y;     bool operator<(const Point &a) const {       if (x != a.x) return x < a.x;       return y < a.y;     }   } tem;   set<Point> p;   set<int> xSet;   set<int> ySet;   bool f() {     if (xSet.size() != 3 || ySet.size() != 3 || p.size() != 8) return false;     set<int>::iterator p1;     set<int>::iterator p2;     int cn = 0;     for (p1 = xSet.begin(); p1 != xSet.end(); p1++) {       for (p2 = ySet.begin(); p2 != ySet.end(); p2++) {         cn++;         if (cn == 5) continue;         tem.x = *p1;         tem.y = *p2;         if (p.find(tem) == p.end()) return false;       }     }     return true;   }   int main(int argc, char **argv) {     int i, a, b;     for (i = 0; i < 8; i++) {       scanf( %d%d , &a, &b);       tem.x = a;       tem.y = b;       xSet.insert(a);       ySet.insert(b);       p.insert(tem);     }     printf( %s n , (f() ?  respectable  :  ugly ));     return 0;   }   