// Dan Deblasio
// 7/22/08
// Solution to BHCSI Contest Problem: Tops
import java.io.*;
import java.util.*;

public class tops{
	public static void main(String args[]) throws FileNotFoundException{
		
		Scanner fin = new Scanner(new File("tops.in"));
		int n = fin.nextInt();
		
		for(int caseNum = 1;caseNum<=n;caseNum++){
		
			// Read in and sort the values.
			int k = fin.nextInt();
			int[] nums = new int[k];
			for(int i=0;i<k;i++){
				String name = fin.next();
				nums[i] = fin.nextInt();
			}
			Arrays.sort(nums);
		
			// Odd number of values in the list.
			if(k%2==1){
				System.out.println("Case #"+caseNum+": "+nums[k-1]+" "+nums[0]+" "+nums[k/2]);
			}
			
			else{
				
				int num = nums[(k/2)-1] + nums[k/2];
			
				// Median is NOT an integer.
				// Note: printf can be used to ensure that only one decimal place prints. 
				//       For simple fractional parts like .5, this works fine.
				if(num%2!=0){
					System.out.println("Case #"+caseNum+": "+nums[k-1]+" "+nums[0]+" "+(double)num/2);
				}
				
				// Median is an integer.
				else{
					System.out.println("Case #"+caseNum+": "+nums[k-1]+" "+nums[0]+" "+num/2);
				}
			}
		}
		fin.close();
	}
}