CF1234A.Equalize Prices Again

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.

你既是附近一家小型商店的店主，也是店员。你有 $n$ 件商品，其中第 $i$ 件商品的价格为 $a_i$ 枚金币。

每当顾客询问某件商品的价格时，你都得记住每件商品各自的价格，这让你感到厌烦，因此你决定简化自己的工作。更具体地说，你决定将自己拥有的全部 $n$ 件商品设定为统一的价格。

然而，你不想亏钱，因此你希望选定的价格满足：所有 $n$ 件商品的新价格之和不小于它们的原始价格之和。换言之，若你以这个新价格售出全部 $n$ 件商品，所获得的总金额至少等于（或大于）按原始价格出售它们所获得的总金额。

另一方面，你又不想因价格过高而流失顾客，因此在所有满足上述条件的价格中，你需要选择最小的那个。

因此，你需要找出一个最小的、适用于全部 $n$ 件商品的统一价格，使得以该价格售出全部商品所得的总收入，至少等于（或大于）按原始价格售出它们所得的总收入。

你需要回答 $q$ 个相互独立的查询。

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.

输入的第一行包含一个整数 $q$（$1 \le q \le 100$），表示查询次数。随后是 $q$ 组查询。

每组查询的第一行包含一个整数 $n$（$1 \le n \le 100$），表示商品数量；第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 10^7$），其中 $a_i$ 表示第 $i$ 个商品的价格。

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.

对于每个查询，请输出其答案——即所有 $n$ 件商品的最小可能的相同售价，使得以该价格出售所有商品所获得的总收入，至少不低于以原始价格出售它们所获得的总收入。