Lucy had recently learned the game, called Natural Numbers.
The rules of the game are really simple. There are N players. At the same time, every player says one natural number. Let's call the number said by the i-th player Ai. The person with the smallest unique number (that is, the smallest number that was not said by anybody else) wins. Sometimes, there is a case when there are no unique numbers at all. Then the game is obviously a draw, so nobody wins it.
Sometimes, it's hard to determine the winner, especially, when the number of players is enormous. So in this problem, your assignment will be: given the names of the players and the numbers every of them have said. Please, tell the name of the winner, or determine that nobody wins.

-----Input-----
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.

The first line of every test case consists of a single integer N - the number of players. Then, N lines will follow. Each of these N lines will consist of the player's name and the number Ai said by her, separated by a single space.

-----Output-----
For each test case, output a single line containing an answer to the corresponding test case - the name of the winner, or a string "Nobody wins.", if nobody wins the game.

-----Example-----
Input:
2
5
Kouta 1
Yuka 1
Mayu 3
Lucy 2
Nana 5
2
Lucy 2
Nana 2

Output:
Lucy
Nobody wins.

-----Scoring-----
Subtask 1 (17 points): T = 10000, 1 <= N <= 10, 1 <= Ai <= 10 

Subtask 2 (19 points): T = 10000, 1 <= N <= 10, 1 <= Ai <= 2*109

Subtask 3 (30 points): T = 100, 1 <= N <= 1000, 1<= Ai <= 2*109

Subtask 4 (34 points): T = 10, 1 <= N <= 10000, 1 <= Ai <= 2*109

You can safely assume that in all the test cases the length of any name will not exceed five letters. All the players'  names  are unique.

Difficulty: interview

Starter code:

Solutions:
try:
    t = int(input())
    while t:
        t -= 1
        n = int(input())
        arr = []
        obj = {}
        for i in range(n):
            x,y = input().split()
            y = int(y)
            arr.append([x, y])
            if y in obj: obj[y].append(x)
            else: obj[y] = [x]
        arr.sort(key = lambda i: i[1], reverse = True)
        while len(arr) and len(obj[arr[-1][1]]) > 1:
            arr.pop()
        if len(arr) == 0:
            print('Nobody wins.')
        else:
            print(arr.pop()[0])
except:
    pass

from collections import defaultdict
def call_value():
    return 0

t=int(input())
while(t>0):
    n=int(input())
    arr=[]
    for _ in range(n):
        s,m = input().split()
        m=int(m)
        arr.append([s,m])
    dic = defaultdict(call_value)
    for i in arr:
        dic[i[1]]+=1
    ans=[]
    for i in dic:
        if(dic[i]==1):
            ans.append(i)
    if(len(ans)==0):
        print("Nobody wins.")
    else:
        mini=min(ans)
        for i in arr:
            if(i[1]==mini):
                print(i[0])
                break
    t-=1



def comp(a,b):
    if len(a) > len(b):
        return b
    elif len(b) > len(a):
        return a
    else:
        i = 0
        while True:
            if a[i] > b[i]:
                return b
            elif b[i] > a[i]:
                return a
            i += 1

for _ in range(int(input())):
    n = int(input())
    a = []
    b = []
    c = []
    for i in range(n):
        name , score = map(str,input().split())
        a.append([name,score])
        if score not in c:
            if score in b:
                b.remove(score)
                c.append(score)
            else:
                b.append(score)

    if len(b) == 0:
        print("Nobody wins.")
    else:
        ans = b[0]
        for i in range(1,len(b)):
            ans = comp(ans,b[i])
        for i in range(len(a)):
            if a[i][1] == ans:
                print(a[i][0])

# cook your dish here
def comp(a,b):
    if len(a) > len(b):
        return b
    elif len(b) > len(a):
        return a
    else:
        i = 0
        while True:
            if a[i] > b[i]:
                return b
            else:
                return a
            i += 1

for _ in range(int(input())):
    n = int(input())
    a = []
    b = []
    c = []
    for i in range(n):
        name , score = map(str,input().split())
        a.append([name,score])
        if score not in c:
            if score in b:
                b.remove(score)
                c.append(score)
            else:
                b.append(score)

    if len(b) == 0:
        print("Nobody wins.")
    else:
        ans = b[0]
        for i in range(1,len(b)):
            ans = comp(ans,b[i])
        for i in range(len(a)):
            if a[i][1] == ans:
                print(a[i][0])


# cook your dish here
for _ in range(int(input())):
    n = int(input())
    a = []
    b = []
    for i in range(n):
        name , score = map(str,input().split())
        a.append([name,score])
        b.append(score)
    a.sort(key = lambda x:x[1])
    b.sort()
    i = 0
    while True:
        p = b.count(b[i])
        if p == 1:
            print(a[i][0])
            break
        else:
            i += p
            if i >= n:
                print("Nobody wins.")
                break
        


# cook your dish here
for _ in range(int(input())):
    n = int(input())
    a = []
    b = []
    for i in range(n):
        name , score = map(str,input().split())
        a.append([name,score])
        b.append(score)
    a.sort(key = lambda x:x[1])
    b.sort()
    i = 0
    while True:
        p = b.count(b[i])
        if p == 1:
            print(a[i][0])
            break
        else:
            i += p
            if i == n:
                print("Nobody wins.")
                break
        


from operator import itemgetter
t=int(input())
for _ in range(t):
    n=int(input())
    di={}
    for i in range(n):
        a,b=input().split()
        b=int(b)
        di.setdefault(b,[])
        di[b].append(a)
    f=0
    for item in sorted(di):
        if len(di[item])==1:
            print(di[item][0])
            f=1
            break
    if f==0:
        print('Nobody wins.')

# cook your dish here
from collections import OrderedDict 
for _ in range(int(input())):
    a=[]
    min=10000
    n=int(input())
    s=[0]*n
    l=[0]*n
    flag=0
    for i in range(n):
        s[i],t=input().split()
        t=int(t)
        a.append(t)
    l=a.copy()   
    a.sort()  
    for x in range(len(a)):
        if a.count(a[x])==1:
            m=x
            flag=1
            break
    if flag==0:
        print("Nobody wins.")
    else:    
        h=l.index(a[m])
        print(s[h])

# input t,n,a[]
# sort integers
# if integer repeats continue
# else break

T=int(input())
for t in range(0,T):
    n=int(input())
    s=[0]*n
    np=[0]*n
    for i in range(0,n):
        s[i],np[i]=input().split()
        np[i]=int(np[i])
    no=np[:]
    no.sort()
    ans='-1'
    if no[0]!=no[1]:
        ans=no[0]
    else:
      for i in range(1,n-1):
          if no[i]!=no[i-1] and no[i]!=no[i+1]:
              ans=no[i]
              break
          else:
              continue
      if ans=='-1' and no[n-2]!=no[n-1]:
          ans=no[n-1]
        
        
    for i in range(0,n):
            if ans==np[i]:
                ans=int(i)
                break
    if ans=='-1':
        print('Nobody wins.')
    else:
        print(s[ans])

# cook your dish here
t = int(input())

for _ in range(t):
    n = int(input())
    l = []
    hash = {}
    for i in range(n):
        a,b = map(str,input().split())
        l.append([a,b])
        try:
            hash[b]
        except:
            hash[b]=1
        else:
            hash[b]+=1
    ans = []
    for i in l:
        a,b = i
        if hash[b] == 1:
            ans.append([int(b),a])
    ans.sort()
    if ans!=[]:
        print(ans[0][1])
    else:
        print('Nobody wins.')








t=int(input())
while(t):
    re=[]
    st={}
    m={}
    for _ in range(int(input())):
        a,b=input().split()
        b=int(b)
        if b in list(st.keys()):
            st[b]+=1
        else:
            st[b]=1
            m[b]=a
        re.append(int(b))
    count=0
    re=list(set(re))
    re.sort()
    ind=0
    for i in re:
        if st[i]==1:
            count+=1
            ind=i
            break
    if count==1:
        print(m[ind])
    else:
        print("Nobody wins.")
    t-=1

from collections import Counter
T=int(input())
for i in range(T):
    NM=[]
    A=[]
    z=0
    N=int(input())
    for j in range(N):
        nm,a=input().split()
        NM.append(nm)
        A.append(int(a))
    D=Counter(A)
    K=sorted(D.keys())
    for k in K:
        if D[k]==1:
            z=k
            break
        else:
            pass
    if z==0:
        print("Nobody wins.")
    else:
        print(NM[A.index(z)])


for _ in range(int(input())):
	q = []

	for __ in range(int(input())):
		a, b = list(input().split())
		b = int(b)
		q.append((a,b))

	q = sorted(q, key= lambda x:x[1])
	#print(q)
	i = 0
	win = ""
	if len(q) == 1:
		#print(q[0][0])
		continue
	while i < len(q):
		#print(i)
		t = q[i][1]

		if i == len(q)-1 or q[i][1] != q[i+1][1]:
			win = q[i][0]
			break

		while i < len(q) and q[i][1] == t:
			#print(q[i][1])
			i += 1
		#print(i)
		if i == len(q):
			break


	if win == "":
		print("Nobody wins.")
	else:
		print(win)












"""
2
5
Kouta 1
Yuka 1
Mayu 3
Lucy 2
Nana 5
2
Lucy 2
Nana 2

"""

for _ in range(int(input())):
    n=int(input())
    goes=[]
    for u in range(n):
        z=input().split()
        goes.append((int(z[1]),z[0]))

    goes.sort()
    res = 'Nobody wins.'
    last = goes[0][0] - 1
    win = False
    for val, nm in goes:
        if val == last:
            win = False
        else:
            if win:
                res = lastnm
                break
            win = True
            lastnm = nm
            last = val

    if win:
        res = lastnm
    print(res)


# https://www.codechef.com/problems/NUMBERS

for _ in range(int(input())):
    n = int(input())
    goes = []
    for _ in range(n):
        z = input().split()
        goes.append( (int(z[1]),z[0]) )

    goes.sort()
    res = 'Nobody wins.'
    last = goes[0][0] - 1
    win = False
    for val, nm in goes:
        if val == last:
            win = False
        else:
            if win:
                res = lastnm
                break
            win = True
            lastnm = nm
            last = val
            
    if win:
        res = lastnm
    print(res)


# https://www.codechef.com/problems/NUMBERS

for _ in range(int(input())):
    n = int(input())
    goes = []
    for _ in range(n):
        z = input().split()
        goes.append( (int(z[1]),z[0]) )

    goes.sort()
    res = 'Nobody wins.'
    last = goes[0][0] - 1
    win = False
    for val, nm in goes:
        if val == last:
            win = False
        else:
            if win:
                res = lastnm
                break
            win = True
            lastnm = nm
            last = val
            
    print(res)