#include<bits/stdc++.h>
using namespace std;
struct item{
int cnt;
int ori_val;
int val()const
{
return (ori_val+cnt)/(cnt+1);
}
bool operator<(item b)const
{
return val()<b.val();
}
};
int main()
{
int T;
scanf("%d",&T);
int no=1;
while(no<=T)
{
int n;
cin>>n;
priority_queue<item> pq;
for(int i=0;i<n;i++)
{
int t;
cin>>t;
pq.push({0,t});
}
int ans=pq.top().val();
for(int i=1;i<=1000;i++)
{
item mx=pq.top();
pq.pop();
mx.cnt++;
pq.push(mx);
ans=min(ans,pq.top().val()+i);
}
printf("Case #%d: %d\n",no++,ans);
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKc3RydWN0IGl0ZW17CglpbnQgY250OwoJaW50IG9yaV92YWw7CglpbnQgdmFsKCljb25zdAoJewoJCXJldHVybiAob3JpX3ZhbCtjbnQpLyhjbnQrMSk7Cgl9Cglib29sIG9wZXJhdG9yPChpdGVtIGIpY29uc3QKCXsKCQlyZXR1cm4gdmFsKCk8Yi52YWwoKTsKCX0KfTsKaW50IG1haW4oKQp7CglpbnQgVDsKCXNjYW5mKCIlZCIsJlQpOwoJaW50IG5vPTE7Cgl3aGlsZShubzw9VCkKCXsKCQlpbnQgbjsKCQljaW4+Pm47CgkJcHJpb3JpdHlfcXVldWU8aXRlbT4gcHE7CgkJZm9yKGludCBpPTA7aTxuO2krKykKCQl7CgkJCWludCB0OwoJCQljaW4+PnQ7CgkJCXBxLnB1c2goezAsdH0pOwoJCX0KCQlpbnQgYW5zPXBxLnRvcCgpLnZhbCgpOwoJCWZvcihpbnQgaT0xO2k8PTEwMDA7aSsrKQoJCXsKCQkJaXRlbSBteD1wcS50b3AoKTsKCQkJcHEucG9wKCk7CgkJCW14LmNudCsrOwoJCQlwcS5wdXNoKG14KTsKCQkJYW5zPW1pbihhbnMscHEudG9wKCkudmFsKCkraSk7CgkJfQoJCXByaW50ZigiQ2FzZSAjJWQ6ICVkXG4iLG5vKyssYW5zKTsKCX0KfQo=