#include <bits/stdc++.h>
using namespace std;
using lint = long long;
int main(void) {
  lint Q, N;
  cin >> Q;
  vector<lint> ans(Q);
  for (int i = 0; i < Q; i++) {
    cin >> N;
    lint sum = 0;
    for (int k = 0; k < N; k++) {
      int x;
      cin >> x;
      sum += x;
    }
    ans[i] = ceil(sum / (double)N);
  }
  for (int i = 0; i < Q; i++) cout << ans[i] << endl;
  return 0;
}
