import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class App {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int cases = Integer.parseInt(sc.nextLine());
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < cases; ++i) {
map.clear();
int cnt = Integer.parseInt(sc.nextLine());
int[] arr = new int[cnt];
for (int j = 0; j < cnt; ++j) {
arr[j] = sc.nextInt();
map.put(arr[j], map.getOrDefault(arr[j], 0) + 1);
}
Arrays.sort(arr);
for (int m = 0; m < cnt; ++m) {
if (m > 0 && arr[m - 1] == arr[m]) continue;
if ((cnt - 2) % arr[m] == 0) {
int div = (cnt - 2) / arr[m];
if (div == arr[m] && map.get(div) > 1 || div != arr[m] && map.containsKey(div) && map.get(div) > 0) {
System.out.println(arr[m] + " " + div);
break;
}
}
}
sc.nextLine();
}
sc.close();
}
}