A beautiful sequence is defined as a sequence that do not have any repeating elements in it.
You will be given any random sequence of integers, and you have to tell whether it is a beautiful sequence or not. 

-----Input:-----
- The first line of the input contains a single integer $T$. $T$ denoting the number of test cases. The description of $T$ test cases is as follows.
- The next line of the input contains a single integer $N$. $N$ denotes the total number of elements in the sequence.
- The next line of the input contains $N$ space-separated integers $A1, A2, A3...An$ denoting the sequence.

-----Output:-----
- Print "prekrasnyy"(without quotes) if the given sequence is a beautiful sequence, else print "ne krasivo"(without quotes)
Note: each test case output must be printed on new line

-----Constraints:-----
- $1 \leq T \leq 10^2$
- $1 \leq N \leq 10^3$
- $1 \leq A1, A2, A3...An \leq 10^5$

-----Sample Input:-----
2
4
1 2 3 4
6
1 2 3 5 1 4

-----Sample Output:-----
prekrasnyy
ne krasivo

-----Explanation:-----
- 
As 1st sequence do not have any elements repeating, hence it is a beautiful sequence
- 
As in 2nd sequence the element 1 is repeated twice, hence it is not a beautiful sequence

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	l = []
	for i in range(0, len(arr)):
		for j in range(i + 1, len(arr)):
			if arr[i] == arr[j]:
				l.append(arr[j])
	if len(l) == 0:
		print('prekrasnyy')
	else:
		print('ne krasivo')


for _ in range(int(input())):
	n = int(input())
	seq = list(map(int, input().split()))
	r = 0
	for i in seq:
		if seq.count(i) > 1:
			r += 1
	if r == 0:
		print('prekrasnyy')
	else:
		print('ne krasivo')


for _ in range(int(input())):
	n = int(input())
	arr = sorted([int(k) for k in input().split()])
	res = True
	for i in range(len(arr) - 1):
		if arr[i] == arr[i + 1]:
			res = False
			break
	if res:
		print('prekrasnyy')
	else:
		print('ne krasivo')


def check(arr, n):
	for a in range(len(arr)):
		if a < len(arr) - 1:
			if arr[a] == arr[a + 1]:
				return True
				break
	return False

def __starting_point():
	t = int(input())
	n = []
	l = []
	for j in range(t):
		n.append(int(input()))
		l.append(list(map(int, input().split())))
		l[j].sort(reverse=True)
	for k in range(t):
		res = check(l[k], n[k])
		if res:
			print('ne krasivo')
		else:
			print('prekrasnyy')
__starting_point()


for i in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()[:n]))
	arr.sort()
	flag = 0
	for j in range(len(arr) - 1):
		if arr[j] == arr[j + 1]:
			print('ne krasivo')
			flag = 1
			break
	if flag == 0:
		print('prekrasnyy')


def pure_it(L, N):
	for j in range(1, N):
		if L[j - 1] == L[j]:
			return 'ne krasivo'
	return 'prekrasnyy'
t = int(input())
for i in range(t):
	N = int(input())
	L = list(map(int, input().split()))
	L.sort()
	print(pure_it(L, N))


for _ in range(int(input())):
	a = input()
	l = list(map(int, input().split()))
	c = 0
	for i in l:
		if l.count(i) > 1:
			c = 1
			break
	if c == 0:
		print('prekrasnyy')
	else:
		print('ne krasivo')


ncases = int(input())
for cases in range(ncases):
	nlen = int(input())
	testlist = list(map(int, input().split()))
	if not testlist:
		continue
	mydict = set()
	beautiful = True
	for a in testlist:
		if a not in mydict:
			mydict.add(a)
		else:
			beautiful = False
	if beautiful:
		print('prekrasnyy')
	else:
		print('ne krasivo')


t = int(input())
for i in range(t):
	n = int(input())
	lst = list(map(int, input().split()))
	s = list(set(lst))
	if len(s) == len(lst):
		print('prekrasnyy')
	else:
		print('ne krasivo')


t = int(input())
while t > 0:
	n = int(input())
	arr = input()
	arr = arr.split()
	if len(arr) == len(set(arr)):
		print('prekrasnyy')
	else:
		print('ne krasivo')
	t -= 1


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	b = set(a)
	if len(b) != len(a):
		print('ne krasivo')
	else:
		print('prekrasnyy')


from sys import stdin
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	arr = list(map(int, stdin.readline().split()))
	d = {}
	for ele in arr:
		d[ele] = d.get(ele, 0) + 1
	for ele in d:
		if d[ele] > 1:
			print('ne krasivo')
			break
	else:
		print('prekrasnyy')


def c(data):
	(n, d) = data
	return 'prekrasnyy' if len(set(d)) == n else 'ne krasivo'

def l():
	return [(int(input()), [int(x) for x in input().split()]) for _ in range(int(input()))]

def __starting_point():
	print('\n'.join(map(c, l())))
__starting_point()


def c(data):
	(n, d) = data
	elem = []
	for i in d:
		if i in elem:
			return 'ne krasivo'
		elem.append(i)
	else:
		return 'prekrasnyy'

def l():
	return [(int(input()), [int(x) for x in input().split()]) for _ in range(int(input()))]

def __starting_point():
	print('\n'.join(map(c, l())))
__starting_point()


T = int(input())
for no in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	d = dict()
	Flag = 0
	for i in range(N):
		if A[i] in d:
			Flag = 1
			break
		else:
			d[A[i]] = 1
	if Flag == 0:
		print('prekrasnyy')
	else:
		print('ne krasivo')


t = int(input())
for x in range(t):
	n = int(input())
	arr = input().split()
	mySet = set(arr)
	if sorted(arr) == sorted(list(mySet)):
		print('prekrasnyy')
	else:
		print('ne krasivo')


t = int(input())
for i in range(t):
	l = int(input())
	se = {int(j) for j in input().split(' ')}
	if l == len(se):
		print('prekrasnyy')
	else:
		print('ne krasivo')


for i in range(int(input())):
	val = int(input())
	data = list(map(int, input().split()))
	data1 = list(data)
	for j in data:
		if data1.pop(0) in data1:
			print('ne krasivo')
			break
		elif len(data1) == 0:
			print('prekrasnyy')


t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	s = set(l)
	if len(l) == len(s):
		print('prekrasnyy')
	else:
		print('ne krasivo')


n = int(input())
for i in range(n):
	m = int(input())
	l = list(map(int, input().split()))
	l.sort()
	a = set(l)
	if len(a) == len(l):
		print('prekrasnyy')
	else:
		print('ne krasivo')