cf 334B

B. Eight Point Sets

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald is very particular to eight point sets. He thinks that any decent eight point set must consist of all pairwise intersections of three distinct integer vertical straight lines and three distinct integer horizontal straight lines, except for the average of these nine points. In other words, there must be three integersx1, x2, x3 and three more integers y1, y2, y3, such that x1 < x2 < x3, y1 < y2 < y3 and the eight point set consists of all points (xi, yj) (1 ≤ i, j ≤ 3), except for point (x2, y2).

You have a set of eight points. Find out if Gerald can use this set?

Input

The input consists of eight lines, the i-th line contains two space-separated integers xi and yi (0 ≤ xi, yi ≤ 106). You do not have any other conditions for these points.

Output

In a single line print word "respectable", if the given set of points corresponds to Gerald's decency rules, and "ugly" otherwise.

Sample test(s)

input

0 0
0 1
0 2
1 0
1 2
2 0
2 1
2 2

output

respectable

input

0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0

output

ugly

input

1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2

output

ugly

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<set>
using namespace std;
set<int> setx,sety;
set<pair<int,int> > myset;
int main()
{
      int x,y;
      for(int i=0;i<8;i++)
      {
            scanf("%d%d",&x,&y);
            setx.insert(x);
            sety.insert(y);
            myset.insert(make_pair(x,y));
      }
      set<int>::iterator itx,ity;
      itx=setx.begin(),ity=sety.begin();
      if(setx.size()==3&&sety.size()==3&&myset.size()==8&&myset.count(make_pair(*(++itx),*(++ity)))==0)
            printf("respectable\n");
      else
            printf("ugly\n");
      return 0;
}