// Arup Guha
// 10/12/2013
// Solution to UCF JV Practice Problem D: Eight Point Sets

import java.util.*;

public class d {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		// Read in all the points.
		pt[] list = new pt[8];
		for (int i=0; i<8; i++) {
			int x = stdin.nextInt();
			int y = stdin.nextInt();
			list[i] = new pt(x,y);
		}

		// Sort by x, then y and solve.
		Arrays.sort(list);
		System.out.println(solve(list));
	}

	public static String solve(pt[] list) {

		// Check which X's should be equal, say no if not.
		if (!equalX(list, 0, 2))
			return "ugly";
		if (!equalX(list, 3, 4))
			return "ugly";
		if (!equalX(list, 5, 7))
			return "ugly";

		// Check Y's that should be equal.
		if (list[0].y != list[3].y || list[0].y != list[5].y)
			return "ugly";
		if (list[1].y != list[6].y)
			return "ugly";
		if (list[2].y != list[4].y || list[2].y != list[7].y)
			return "ugly";

		// But, we need to make sure that these X's AND Y's AREN'T equal!!!
		if (list[2].x == list[3].x || list[4].x == list[5].x)
			return "ugly";
		if (list[0].y == list[1].y || list[1].y == list[2].y)
			return "ugly";

		// Okay, if we get here, we're good.
		return "respectable";
	}

	// Returns true iff list[start...end] are all the same.
	public static boolean equalX(pt[] list, int start, int end) {

		for (int i=start+1; i<=end; i++)
			if (list[start].x != list[i].x)
				return false;

		return true;
	}
}

// Just so we can sort the points by x then y.
class pt implements Comparable<pt> {

	public int x;
	public int y;

	public pt(int a, int b) {
		x = a;
		y = b;
	}

	public int compareTo(pt other) {
		if (this.x != other.x) return this.x-other.x;
		return this.y - other.y;
	}
}