#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
scanf("%d",&T);
int no=1;
while(no<=T)
{
int n;
cin>>n;
priority_queue<int> pq;
for(int i=0;i<n;i++)
{
int t;
cin>>t;
pq.push(t);
}
int ans=pq.top();
for(int i=1;i<=1000;i++)
{
int mx=pq.top();
pq.pop();
pq.push(mx/2);
pq.push((mx+1)/2);
ans=min(ans,pq.top()+i);
}
printf("Case #%d: %d\n",no++,ans);
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CglpbnQgVDsKCXNjYW5mKCIlZCIsJlQpOwoJaW50IG5vPTE7Cgl3aGlsZShubzw9VCkKCXsKCQlpbnQgbjsKCQljaW4+Pm47CgkJcHJpb3JpdHlfcXVldWU8aW50PiBwcTsKCQlmb3IoaW50IGk9MDtpPG47aSsrKQoJCXsKCQkJaW50IHQ7CgkJCWNpbj4+dDsKCQkJcHEucHVzaCh0KTsKCQl9CgkJaW50IGFucz1wcS50b3AoKTsKCQlmb3IoaW50IGk9MTtpPD0xMDAwO2krKykKCQl7CgkJCWludCBteD1wcS50b3AoKTsKCQkJcHEucG9wKCk7CgkJCXBxLnB1c2gobXgvMik7CgkJCXBxLnB1c2goKG14KzEpLzIpOwoJCQlhbnM9bWluKGFucyxwcS50b3AoKStpKTsKCQl9CgkJcHJpbnRmKCJDYXNlICMlZDogJWRcbiIsbm8rKyxhbnMpOwoJfQp9