// Arup Guha
// 9/17/2013
// Solution to 2012 UCF HS Problem: Price

import java.util.*;
import java.io.*;

public class price {

	public static void main(String[] args) throws Exception {

		Scanner fin = new Scanner(new File("price.in"));
		int numCases = fin.nextInt();

		// Go through each case.
		for (int loop=1; loop<=numCases; loop++) {

			// Read in values and sort.
			int n = fin.nextInt();
			int[] vals = new int[n];
			for (int i=0; i<n; i++)
				vals[i] = fin.nextInt();
			Arrays.sort(vals);

			int mode = vals[0], maxfreq = 1, curfreq = 1;

			// Loop though sorted values looking at each run.
			for (int i=1; i<n; i++) {

				// Update current frequency.
				if (vals[i] == vals[i-1])
					curfreq++;
				else
					curfreq = 1;

				// Update the maximum frequency, if necessary.
				if (curfreq > maxfreq) {
					maxfreq = curfreq;
					mode = vals[i];
				}
			}

			// Output result.
			System.out.println("Item #"+loop+": Most likely price is "+mode+" cents.\n");
		}

		fin.close();
	}
}