#include <bits/stdc++.h>
using namespace std;
const int CMax = 200002;
const int CVMax = 31;
const int CInf = 2000000001;
const long long CMod = 1000000007;
int x, n, A[CMax];
long long K[3][2];
long long res;
vector<pair<int, int> > V[3];
long long gcd(long long a, long long b) {
  if (b != 0)
    return gcd(b, a % b);
  else
    return a;
}
int main() {
  scanf("%d", &x);
  long long sum = 0;
  for (int li = 0; li < x; li++) {
    scanf("%d", &n);
    sum = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &A[i]);
      sum += (long long)A[i];
    }
    cout << ((sum / (long long)n) + (sum % n == 0 ? 0 : 1)) << endl;
  }
  return 0;
}
