You are both a shop keeper and a shop assistant at a small nearby shop. You have $n$ goods, the $i$-th good costs $a_i$ coins.

You got tired of remembering the price of each product when customers ask for it, thus you decided to simplify your life. More precisely you decided to set the same price for all $n$ goods you have.

However, you don't want to lose any money so you want to choose the price in such a way that the sum of new prices is not less than the sum of the initial prices. It means that if you sell all $n$ goods for the new price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.

On the other hand, you don't want to lose customers because of big prices so among all prices you can choose you need to choose the minimum one.

So you need to find the minimum possible equal price of all $n$ goods so if you sell them for this price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.

You have to answer $q$ independent queries.


-----Input-----

The first line of the input contains one integer $q$ ($1 \le q \le 100$) — the number of queries. Then $q$ queries follow.

The first line of the query contains one integer $n$ ($1 \le n \le 100)$ — the number of goods. The second line of the query contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^7$), where $a_i$ is the price of the $i$-th good.


-----Output-----

For each query, print the answer for it — the minimum possible equal price of all $n$ goods so if you sell them for this price, you will receive at least the same (or greater) amount of money as if you sell them for their initial prices.


-----Example-----
Input
3
5
1 2 3 4 5
3
1 2 2
4
1 1 1 1

Output
3
2
1

Difficulty: introductory

Starter code:

Solutions:
for _ in range(int(input())):
    n = int(input())
    A = list(map(int, input().split()))
    s = sum(A)
    print((s + n - 1) // n)

import math
import itertools
import collections

def getdict(n):
    d = {}
    if type(n) is list or type(n) is str:
        for i in n:
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    else:
        for i in range(n):
            t = ii()
            if t in d:
                d[t] += 1
            else:
                d[t] = 1
    return d
def cdiv(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a*b) // math.gcd(a, b)
def wr(arr): return ''.join(map(str, arr))
def revn(n): return int(str(n)[::-1])
def prime(n):
    if n == 2:
        return True
    if n % 2 == 0 or n <= 1:
        return False
    sqr = int(math.sqrt(n)) + 1
    for d in range(3, sqr, 2):
        if n % d == 0:
            return False
    return True

q = ii()
for i in range(q):
    n = ii()
    a = li()
    print(math.ceil(sum(a)/n))

# Contest: Codeforces Round #590 (Div. 3) (https://codeforces.com/contest/1234)
# Problem: A: Equalize Prices Again (https://codeforces.com/contest/1234/problem/A)

def rint():
    return int(input())


def rints():
    return list(map(int, input().split()))


q = rint()
for _ in range(q):
    n = rint()
    a = rints()
    print((sum(a) + n - 1) // n)


#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=int(input())
for tt in range(t):
    n=int(input())
    #n,k,s= map(int, sys.stdin.readline().split(' '))
    a=list(map(int,sys.stdin.readline().split(' ')))
    s=sum(a)
    v=(s//n)
    if(v*n<s):
        v+=1
    print(v)
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

def ii(): return int(input())
def fi(): return float(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

import math

q=ii()
for i in range(q):
    n=ii()
    a=li()
    s=sum(a)
    ans=math.ceil(s/n)
    print(ans)

import math
q = int(input())
for i in range(q):
	n = int(input())
	s = sum(map(int, input().split()))
	print(int(math.ceil(s / n)))
	


import math

q = int(input())

for _ in range(q):
	n = int(input())
	a = list(map(int, input().split()))

	s = sum(a)

	r = s/len(a)
	r = math.ceil(r)

	print(r)

a = int(input())
for i in range(a):
    b = int(input())
    l = list(map(int, input().split()))
    print((sum(l)+b-1)//b)

q = int(input())
for i in range(q):
    n = int(input())
    a = list(map(int, input().split()))
    print((sum(a) + n - 1) // n)


import math
q=int(input())
for i  in range(q):
    n=int(input())
    a=[int(x) for x in input().split()]
    print(math.ceil(sum(a)/n))


for _ in range(int(input())):
    n = int(input())
    li = list(map(int, input().split()))
    print((sum(li) + n - 1) // n)

"""
NTC here
"""
from sys import setcheckinterval, stdin, setrecursionlimit
setcheckinterval(1000)
setrecursionlimit(10**7)
 
# print("Case #{}: {} {}".format(i, n + m, n * m))
 
 
def iin(): return int(stdin.readline())
 
 
def lin(): return list(map(int, stdin.readline().split()))


for _ in range(iin()):
    n=iin()
    a=lin()
    sm=sum(a)
    print((sm+n-1)//n)

#
# Yet I'm feeling like
# 	There is no better place than right by your side
# 		I had a little taste
# 			And I'll only spoil the party anyway
# 				'Cause all the girls are looking fine
# 					But you're the only one on my mind

import sys
# import re
inf = float("inf")
# sys.setrecursionlimit(1000000)

# abc='abcdefghijklmnopqrstuvwxyz'
# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod,MOD=1000000007,998244353
# vow=['a','e','i','o','u']
# dx,dy=[-1,1,0,0,-1,1,-1,1],[0,0,1,-1,1,1,-1,-1]

# from functools import reduce
# from collections import deque, Counter, OrderedDict,defaultdict
# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd,log10,atan,tan
# from bisect import bisect_left,bisect_right,insort_left
# import numpy as np
# import queue
# from copy import deepcopy
# import random
# import operator

def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

T=int(input())
while T:
    n=int(input())
    Arr=get_array()
    s=sum(Arr)
    ans = ceil(s/n)
    print(ans)
    T-=1

# import sys
# sys.stdin = open("in.txt", "r")

t = int(input())

for i in range(t):
    n = int(input())
    arr = [ int(x) for x in input().split() ]
    s = sum(arr)
    avg = s // n
    if avg * n < s: avg += 1
    print(avg)

import sys
input = sys.stdin.readline

q=int(input())

for testcases in range(q):
    n=int(input())
    A=list(map(int,input().split()))

    print(-(-sum(A)//n))


for _ in range(int(input())):
    n = int(input())
    a = sum(list(map(int, input().split())))

    print((a+n-1)//n)


import math
n = int(input())
for i in range(n):
    k = int(input())
    a = [int(i) for i in input().split()]
    print(math.ceil(sum(a) / k))

import math
for i in range(int(input())):
    n = int(input())
    t = list(map(int, input().split()))
    print(math.ceil(sum(t)/n))


q = int(input())
for _ in range(q):

    n = int(input())
    a = [int(x) for x in input().split()]
    print((sum(a)+n-1)//n)



def mp():
    return map(int, input().split())

q = int(input())
for qq in range(q):
    n = int(input())
    a = list(mp())
    s = sum(a)
    print((s + n - 1) // n)

q = int(input())
for i in range(q):
    n = int(input())
    prices_sum = sum(list(map(int, input().split())))
    print(prices_sum // n + bool(prices_sum % n))


for c in range(int(input())) :
    n = int(input())
    a = list(map(int, input().split()))
    tot = sum(a)
    print( (tot + n - 1) // n )


from math import ceil

for i in range(int(input())):
    n = int(input())
    ar = list(map(int, input().split()))
    x = sum(ar)
    if x % len(ar) == 0:
        print(x // len(ar))
    else:
        print(ceil(x / len(ar)))


import io, sys, atexit, os
import math as ma
from decimal import Decimal as dec
from itertools import permutations
from itertools import combinations


def li ():
	return list (map (int, sys.stdin.readline ().split ()))


def num ():
	return map (int, sys.stdin.readline ().split ())


def nu ():
	return int (input ())


def find_gcd ( x, y ):
	while (y):
		x, y = y, x % y
	return x


def lcm ( x, y ):
	gg = find_gcd (x, y)
	return (x * y // gg)






mm = 1000000007

def solve ():
	t = nu()
	for tt in range (t):
		n=nu()
		a=li()
		s=sum(a)
		print(int(ma.ceil(s/n)))













def __starting_point():
	solve ()
__starting_point()