#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int dx[4] = {0, 0, -1, 1};
int dy[4] = {-1, 1, 0, 0};
int par[1005];
int _find(int x) { return par[x] == x ? x : par[x] = _find(par[x]); }
int _union(int x, int y) {
  x = _find(x), y = _find(y);
  if (x == y) return 0;
  par[x] = y;
  return 1;
}
int N, M;
int arr[100005];
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N;
  for (int i = 1; i <= N; i++) {
    int hap = 0;
    cin >> M;
    for (int i = 1; i <= M; i++) {
      int x;
      cin >> x;
      hap += x;
    }
    int ans = 1000000000;
    int le = 1, ri = 10000000;
    while (le <= ri) {
      int mid = (le + ri) / 2;
      if (mid * M >= hap) {
        ri = mid - 1;
        ans = min(ans, mid);
      } else {
        le = mid + 1;
      }
    }
    cout << ans << '\n';
  }
}
