#include <bits/stdc++.h>   using namespace std;   struct node {     int x, y;   } p[8];   int cmp(node a, node b) {     if (a.x == b.x) return (a.y < b.y);     return a.x < b.x;   }   int main() {     while (scanf( %d %d , &p[0].x, &p[0].y) != EOF) {       int cnt1 = 0;       int cnt2 = 0;       int cnt3 = 0;       int cnt4 = 0;       for (int i = 1; i < 8; i++) {         scanf( %d %d , &p[i].x, &p[i].y);       }       sort(p, p + 8, cmp);       node zuoshang = p[0];       node youxia = p[7];       for (int i = 1; i < 7; i++) {         if (p[i].x == zuoshang.x) cnt1++;         if (p[i].y == zuoshang.y) cnt2++;         if (p[i].x == youxia.x) cnt3++;         if (p[i].y == youxia.y) cnt4++;       }       if (cnt1 == 2 && cnt2 == 2 && cnt3 == 2 && cnt4 == 2 && p[1].y == p[6].y &&           p[4].x == p[3].x)         puts( respectable );       else         puts( ugly );     }     return 0;   }   