#include <bits/stdc++.h>
using namespace std;
int comp(pair<long long, long long> p1, pair<long long, long long> &p2) {
  return p1.first - p1.second > p2.first - p2.second;
}
int gcd(int a, int b) {
  if (a > b) {
    int temp = b;
    b = a;
    a = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
int a[1005];
map<long long, long long> ma;
vector<multiset<long long>> vvi;
map<int, int> mp;
int main() {
  int t;
  cin >> t;
  int k;
  for (int i = 0; i < t; ++i) {
    cin >> k;
    int temp;
    double ans = 10000000000;
    int z, x;
    map<int, int> m;
    for (int j = 0; j < k; ++j) {
      scanf("%d", &temp);
      m[temp]++;
    }
    int pr = -1;
    for (map<int, int>::iterator it = m.begin(); it != m.end(); ++it) {
      if (it->second >= 4) {
        printf("%d %d %d %d\n", it->first, it->first, it->first, it->first);
        ans = -1;
        break;
      }
      if (it->second >= 2) {
        int j = it->first;
        if (pr != -1) {
          double tempAns = (j - pr) * (j - pr * 1.0) / (j * pr);
          if (tempAns < ans) {
            ans = tempAns;
            z = pr;
            x = j;
          }
        }
        pr = j;
      }
    }
    if (ans != -1) {
      printf("%d %d %d %d\n", x, x, z, z);
    }
  }
  return 0;
}
