#include <bits/stdc++.h>
#pragma GCC Optimize("Ofast")
#pragma GCC Optimize "trapv"
#pragma comment(linker, "/STACK: 2000000")
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
const long long Inf = 1e9 + 5;
const long long m = 1e9 + 7;
namespace funset {
bool checkvow(char x) { return ((0x208222) >> (x & (0x1f))) & 1; }
long long highpow2(long long x) { return (x & ~(x - 1)); }
bool chk2(long long x) { return (x & (x - 1)); }
}  // namespace funset
using namespace funset;
long long strhash(string s) {
  const long long p = 31;
  const long long m = 1e9 + 7;
  long long hashval = 0;
  long long powe = 1;
  for (char c : s) {
    hashval = (hashval + (c - 'a' + 1) * powe) % m;
    powe = (powe * p) % m;
  }
  return hashval;
}
long long fact(long long n) {
  if (n <= 1) return 1;
  return n * fact(n - 1);
}
const long long Mxn = 2 * 1e5;
long long a[Mxn], n;
void solve() {
  cin >> n;
  long long a[n], sum = 0;
  for (long long &i : a) {
    cin >> i;
    sum += i;
  }
  if (sum % n == 0) {
    cout << 1ll * sum / n << "\n";
    ;
    return;
  }
  cout << 1ll * ((sum - (sum % n)) + n) / n << "\n";
  ;
}
int main() {
  auto beg = clock();
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t;
  cin >> t;
  while (t--) solve();
  auto ted = clock();
  return 0;
}
