#include <bits/stdc++.h>
typedef struct {
  int x, y;
} R;
int compare(const void *a, const void *b) {
  R *aa = (R *)a;
  R *bb = (R *)b;
  if (aa->x < bb->x) {
    return -1;
  } else if (aa->x > bb->x) {
    return 1;
  } else if (aa->y < bb->y) {
    return -1;
  } else if (aa->y > bb->y) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  R p[8];
  int i, minx, midx, maxx, miny, midy, maxy;
  for (i = 0; i < 8; ++i) scanf("%d%d", &(p[i].x), &(p[i].y));
  minx = 10000000;
  maxx = -1;
  miny = 10000000;
  maxy = -1;
  for (i = 0; i < 8; ++i) {
    if (p[i].x < minx) minx = p[i].x;
    if (p[i].x > maxx) maxx = p[i].x;
    if (p[i].y < miny) miny = p[i].y;
    if (p[i].y > maxy) maxy = p[i].y;
  }
  midx = -1;
  midy = -1;
  for (i = 0; i < 8; ++i) {
    if (p[i].x != minx && p[i].x != maxx) midx = p[i].x;
    if (p[i].y != miny && p[i].y != maxy) midy = p[i].y;
  }
  if ((minx == maxx) || (miny == maxy) || (midx == -1) || (midy == -1)) {
    printf("ugly\n");
    return 0;
  }
  for (i = 0; i < 8; ++i) {
    if ((p[i].x != minx && p[i].x != maxx && p[i].x != midx) ||
        (p[i].y != miny && p[i].y != maxy && p[i].y != midy)) {
      printf("ugly\n");
      return 0;
    }
  }
  qsort(p, 8, sizeof(R), compare);
  if (p[0].x == minx && p[1].x == minx && p[2].x == minx && p[3].x == midx &&
      p[4].x == midx && p[5].x == maxx && p[6].x == maxx && p[7].x == maxx &&
      p[0].y == miny && p[1].y == midy && p[2].y == maxy && p[3].y == miny &&
      p[4].y == maxy && p[5].y == miny && p[6].y == midy && p[7].y == maxy) {
    printf("respectable\n");
  } else {
    printf("ugly\n");
  }
  return 0;
}
