Well known investigative reporter Kim "Sherlock'' Bumjun needs your help! Today, his mission is to sabotage the operations of the evil JSA. If the JSA is allowed to succeed, they will use the combined power of the WQS binary search and the UFDS to take over the world!
But Kim doesn't know where the base is located. He knows that the base is on the highest peak of the Himalayan Mountains. He also knows the heights of each of the $N$ mountains. Can you help Kim find the height of the mountain where the base is located? 

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow.    
- The first line in each testcase contains one integer, $N$.    
- The following $N$ lines of each test case each contain one integer: the height of a new mountain.

-----Output:-----
For each testcase, output one line with one integer: the height of the tallest mountain for that test case.

-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 100000$
- $0 \leq$ height of each mountain $\leq 10^9$

-----Subtasks:-----
- 100 points: No additional constraints.

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

-----Sample Output:-----
7

Starter code:

Solutions:
n=int(input())
def do():
 t=int(input())
 x=[]
 for i in range(t):
  x.append(int(input()))
 print(max(x))
 return
for i in range(n):
 do()

t=int(input())
def do():
 n=int(input())
 a=[]
 for i in range(n):
  a.append(int(input()))
 print(max(a))
 return
for i in range(t):
 do()

# cook your dish here
t=int(input())
def do():
 n=int(input())
 l=[]
 for i in range(n):
  l.append(int(input()))
 print(max(l))
 return
for i in range(t):
 do()
  


# cook your dish here
for _ in range(int(input())):
 n=int(input())
 d=[]
 for i in range(n):
  d.append(int(input()))
 print(max(d))

for _ in range(int(input())):
 no_inpt = int(input())
 height_mn = []
 for _ in range(no_inpt):
  height_mn.append(int(input()))
 height_mn.sort()
 print(max(height_mn))

# cook your dish here
test=int(input())
def base_mountain(x):
 max=x[0]
 for mountain in x:
  if mountain>max:
   max=mountain
 return max


 
for t in range(test):
 numbers=int(input())
 mountains=[]
 for j in range(numbers):
  a=int(input())
  mountains.append(a)
  
  
 print(base_mountain(mountains))


# cook your dish here
t=int(input())
for i in range(t):
 n=int(input())
 l=[]
 for j in range(n):
  l.append(input())
 print(max(l))

t=int(input())
for i in range(t):
 n=int(input())
 a=[]
 for i in range(n):
  k=int(input())
  a.append(k)
 print(max(a))

# cook your dish here
for i in range(int(input())):
 n=int(input())
 A=[]
 for j in range(n):
  A.append(input())
 print(max(A))


T=int(input())
for i in range(T):
 n=int(input())
 l=[]
 for j in range(n):
  l.append(input())
 print(max(l))

T=int(input())
for i in range(T):
 n=int(input())
 l=[]
 for j in range(n):
  l.append(input())
 print(max(l))
  


# cook your dish here
for _ in range(int(input())):
 l=[]
 for i in range(int(input())):
  l.append(int(input()))
 print(max(l))

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 arr=[]
 for i in range(n):
  arr.append(int(input()))
 print(max(arr))

for t in range(int(input())):
 n = int(input())
 numberlist =[]
 for i in range(n):
  numberlist.append(int(input()))
 numberlist.sort()
 print(numberlist[-1])






t=int(input())
for _ in range(t):
 n=int(input())
 maxi=0
 for i in range(n):
  k=int(input())
  if(k>maxi):
   maxi=k
   
 print(maxi)

t = int(input())
for _ in range(t):
 n = int(input())
 H = -1
 for i in range(n):
  h = int(input())
  if h>H:
   H = h
 print(H)

# cook your dish here
for _ in range(int(input())):
 x=int(input())
 n=[]
 for i in range(x):
  n.append(int(input()))

 print(max(n))

for i in range(int(input())):
 x=int(input()) 
 n=[]
 for j in range(x):
  z=int(input()) 
  n.append(z)
 print(max(n))

for i in range(int(input())):
 m = 0
 for j in range(int(input())):
  x = int(input())
  if x > m:
   m = x
 print(m)# cook your dish here


# cook your dish here
t=int(input())
for i in range(0,t):
 s=int(input())
 g=[]
 for i in range(0,s):
  k=int(input())
  g.append(k)
 print(max(g))

for t in range(int(input())):
 n=int(input())
 x=int(input())
 for i in range(n-1):
  y=int(input())
  if y>x:
   x=y
 print(x)

# cook your dish here
t=int(input())
while t>0:
 mi=-1
 n=int(input())
 while n>0:
  q=int(input())
  if q>mi:
   mi=q
  n=n-1
 print(mi)
 t=t-1
  


for i in range(int(input())):
 m=0
 for j in range(int(input())):
  x=int(input())
  if x>m:
   m=x
 print(m)

for _ in range(int(input())):
 n = int(input())
 x = 0 
 for i in range(n):
  a = int(input())
  if a>x:
   x=a 
 print(x) 

# cook your dish here
for i in range(int(input())):
 p=int(input())
 ls = []
 for i in range(p):
  ls.append(int(input()))
 print(max(ls))