Monk and Lucky Minimum.Py

'''https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/monk-and-lucky-minimum-3/'''

t=int(input())
for i in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    a.sort()
    c=a.count(a[0])
    if c%2==0:
        print('Unlucky')
    else:
        print('Lucky')