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

Difficulty: EASY
Tags: Implementation

Starter code:

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


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


t = int(input())
for _ in range(t):
	n = int(input())
	x = []
	for _ in range(n):
		n1 = int(input())
		x.append(n1)
	print(max(x))


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


t = int(input())
while t > 0:
	l = []
	n = int(input())
	for i in range(n):
		x = int(input())
		l.append(x)
	print(max(l))
	t -= 1


for _ in range(int(input())):
	n = int(input())
	y = []
	for i in range(n):
		y.append(int(input()))
	print(max(y))


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


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()


t = int(input())
for _ in range(t):
	n = int(input())
	A = []
	for i in range(0, n):
		x = int(input())
		A.append(x)
	print(max(A))


for _ in range(int(input())):
	s = int(input())
	a = []
	for i in range(s):
		p = int(input())
		a.append(p)
	print(max(a))


for _ in range(int(input())):
	n = int(input())
	li = []
	for i in range(n):
		li.append(int(input()))
	print(max(li))


t = int(input())
for i in range(t):
	n = int(input())
	m = -1
	for j in range(n):
		m = max(m, int(input()))
	print(m)


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


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


for i in range(int(input())):
	x = int(input())
	v = []
	for i in range(x):
		l = int(input())
		v.append(l)
	v.sort()
	print(v[-1])


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


for _ in range(int(input())):
	n = int(input())
	arr = []
	for i in range(n):
		arr.append(int(input()))
	print(max(arr))


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


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


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))


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


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


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


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


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 t in range(0, T):
	N = int(input())
	highest = 0
	for n in range(0, N):
		height = int(input())
		if height > highest:
			highest = height
	print(highest)


T = int(input())
for i in range(T):
	N = int(input())
	H = 0
	for j in range(N):
		h = int(input())
		if j == 0:
			H = h
		elif h > H:
			H = h
		else:
			continue
	print(H)


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


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


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


t = int(input())
for i in range(t):
	n = int(input())
	mranges = []
	for m in range(n):
		height = int(input())
		mranges.append(height)
	largest = mranges[0]
	for m in range(n):
		if mranges[m] > largest:
			largest = mranges[m]
	print(largest)


t = int(input())
while t > 0:
	n = int(input())
	max = 0
	for i in range(n):
		i = int(input())
		if i > max:
			max = i
	print(max)
	t -= 1


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


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


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))


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


t = int(input())
for i in range(t):
	b = 0
	l = []
	n = int(input())
	for i in range(n):
		b = int(input())
		l.append(b)
	print(max(l))


def find_tallest_mountain(n, heights):
	tallest = 0
	for height in heights:
		if height > tallest:
			tallest = height
	return tallest
t = int(input())
for i in range(t):
	n = int(input())
	heights = []
	for j in range(n):
		height = int(input())
		heights.append(height)
	tallest_mountain = find_tallest_mountain(n, heights)
	print(tallest_mountain)


for _ in range(int(input())):
	n = int(input())
	mx = -1
	for i in range(n):
		c = int(input())
		mx = max(mx, c)
	print(mx)


for i in range(int(input())):
	NO = int(input())
	ans = 0
	for i in range(NO):
		a = int(input())
		if a > ans:
			ans = a
	print(ans)


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


for i in range(int(input())):
	p = int(input())
	ls = []
	for i in range(p):
		ls.append(int(input()))
	print(max(ls))


for _ in range(int(input())):
	arr1 = []
	for x in range(int(input())):
		arr1.append(int(input()))
	print(max(arr1))


for i in range(int(input())):
	n = int(input())
	max = 0
	for j in range(n):
		peak = int(input())
		if peak >= max:
			max = peak
	print(max)


try:
	for i in range(int(input())):
		g = int(input())
		z = []
		for t in range(g):
			z.append(int(input()))
		print(max(z))
except Exception as e:
	pass


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)


for i in range(int(input())):
	n = int(input())
	li = [int(input()) for i in range(n)]
	print(max(li))


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


t = int(input())
for _ in range(t):
	n = int(input())
	l = []
	for i in range(n):
		val = int(input())
		l.append(val)
	print(max(l))


for t in range(int(input())):
	n = int(input())
	m = 0
	for i in range(n):
		a = int(input())
		m = max(m, a)
	print(m)


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))


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)


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


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


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


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


t = int(input())
for tc in range(t):
	n = int(input())
	b = []
	for j in range(n):
		j = int(input())
		b.append(j)
	print(max(b))


for _ in range(int(input())):
	n = int(input())
	d = []
	for i in range(n):
		d.append(int(input()))
	print(max(d))


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


for T in range(int(input())):
	n = int(input())
	h = []
	for i in range(n):
		h.append(int(input()))
	min_element = h[0]
	for x in h:
		if x > min_element:
			min_element = x
	print(min_element)


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


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)


for _ in range(int(input())):
	ma = 0
	n = int(input())
	for __ in range(n):
		s = int(input())
		if s > ma:
			ma = s
	print(ma)


for i in range(int(input())):
	x = int(input())
	max_ = 0
	for j in range(x):
		max_ = max(max_, int(input()))
	print(max_)


for _ in range(int(input())):
	n = int(input())
	m1 = 0
	for i in range(n):
		a = int(input())
		m1 = max(m1, a)
	print(m1)


t = int(input())
while t:
	N = int(input())
	arr = []
	for i in range(N):
		arr.append(int(input()))
	print(max(arr))
	t = t - 1


for _ in range(int(input())):
	n = int(input())
	m = []
	for i in range(n):
		m.append(int(input()))
	print(max(m))


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 _ in range(int(input())):
	x = int(input())
	n = []
	for i in range(x):
		n.append(int(input()))
	print(max(n))


for _ in range(int(input())):
	N = int(input())
	ls = []
	for i in range(N):
		ls.append(int(input()))
	print(max(ls))


def largest(arr, n):
	ma = arr[0]
	for i in range(1, n):
		if arr[i] > ma:
			ma = arr[i]
	return ma
for _ in range(int(input())):
	n = int(input())
	a = []
	for _ in range(n):
		ele = int(input())
		a.append(ele)
	print(largest(a, n))


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