```go
package main

import (
	"fmt"
	"sort"
)

func main() {
	var points [][2]int
	set := make(map[[2]int]struct{})
	for i := 0; i < 8; i++ {
		var x, y int
		fmt.Scan(&x, &y)
		p := [2]int{x, y}
		points = append(points, p)
		if _, ok := set[p]; ok {
			fmt.Println("ugly")
			return
		}
		set[p] = struct{}{}
	}
	xs := make(map[int]struct{})
	ys := make(map[int]struct{})
	for _, p := range points {
		xs[p[0]] = struct{}{}
		ys[p[1]] = struct{}{}
	}
	if len(xs) != 3 || len(ys) != 3 {
		fmt.Println("ugly")
		return
	}
	var xlist []int
	for x := range xs {
		xlist = append(xlist, x)
	}
	sort.Ints(xlist)
	var ylist []int
	for y := range ys {
		ylist = append(ylist, y)
	}
	sort.Ints(ylist)
	var missing [2]int
	foundMissing := false
	for i := 0; i < 3; i++ {
		for j := 0; j < 3; j++ {
			p := [2]int{xlist[i], ylist[j]}
			if _, ok := set[p]; !ok {
				if foundMissing {
					fmt.Println("ugly")
					return
				}
				missing = p
				foundMissing = true
			}
		}
	}
	if !foundMissing {
		fmt.Println("ugly")
		return
	}
	if missing[0] == xlist[1] && missing[1] == ylist[1] {
		fmt.Println("respectable")
	} else {
		fmt.Println("ugly")
	}
}
```