import java.util.*;
public class b {
	Scanner in=new Scanner(System.in);
	public static void main(String[] args) {
		new b().go();
	}
	private void go() {
		int t=in.nextInt();
		for(int cnum=0;cnum<t;cnum++){
			int d=in.nextInt();
			ArrayList<Integer> p=new ArrayList<Integer>();
			for(int i=0;i<d;i++)p.add(in.nextInt());
			Collections.sort(p,Collections.reverseOrder());//nice to have biggest pancake
			int ans=Integer.MAX_VALUE;
			int diff=1;
			while(true){//bound optimal minutes on the right
				int tempans = eval_minute_count(diff,p);
				if(tempans<ans){//upslope...double diff and try again
					ans=tempans;
					diff<<=1;
				}
				else break;//downslope...found a maximum...bail
			}
			ans=eval_minute_count(0,p);
			int m=0;
			while(diff>0){//binary search on minutes to find min
				int tempans = eval_minute_count(diff+m, p);
				if(tempans<ans){
					ans=tempans;
					m+=diff;
				}
				diff>>=1;
			}
			for(int i=Math.max(0, m-10);i<m+10;i++){//number of special minutes
				for(int j=1;j<1000;j++){//number of pancakes to remove
					PriorityQueue<Integer> pq=new PriorityQueue<Integer>(p.size(),Collections.reverseOrder());
					pq.addAll(p);
					for(int k=0;k<i;k++){//loop over special minutes
						int on=pq.poll();
						if(j>on/2+1||j>=on){//biggest stack is smaller than our optimal size already...break
							pq.offer(on);
							break;
						}
						pq.offer(on-j);//take j off the stack in a new pile
						pq.offer(j);
					}
					ans=Math.min(ans, i+pq.peek());//special minutes plus biggest plate left
				}
			}
			System.out.printf("Case #%d: %d\n",cnum+1,ans);
		}
	}
	private int eval_minute_count(int i, ArrayList<Integer> p) {
		int ans=eval_flip(1,i,p);
		int diff=1;
		while(diff<=p.get(0)/2)diff<<=1;//optimal size is less than half the size the largest stack
		diff>>=1;
		int f=0;
		while(diff>0){//binary search again!
			int tempans = eval_flip(f+diff,i,p);
			if(tempans<ans){
				ans=tempans;
				f+=diff;
			}
			diff>>=1;
		}
		return ans;
	}
	private int eval_flip(int j, int i, ArrayList<Integer> p) {
		PriorityQueue<Integer> pq=new PriorityQueue<Integer>(p.size(),Collections.reverseOrder());
		pq.addAll(p);
		for(int k=0;k<i;k++){//loop over special minutes
			int on=pq.poll();
			if(j>on/2+1||j>=on){//biggest stack is smaller than our optimal size already...break
				pq.offer(on);
				break;
			}
			pq.offer(on-j);//take j off the stack in a new pile
			pq.offer(j);
		}
		return i+pq.peek();
	}
}