PIZDONCHIK

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main ()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    ios::sync_with_stdio();cin.tie();
    ll n;
    cin >> n;
    vector<pair<int, int>> ans(n);
    for(int i = 0; i < n; i++){
    ll m;
    cin >> m;
    set<int> s1;
    map<int, int> mapik;
    for(int j = 0; j < m; j++){
        int x;
        cin >> x;
        if(s1.find(x) == s1.end()){
            mapik.insert({x, 1});
            s1.insert(x);
        }
        else mapik[x]++;
    }
        int k = 0;
        vector<int> gr;
        for(auto j = s1.begin(); j != s1.end(); j++){
            int r = *(j);
            if(mapik[r] >= 4){
                k = 1;
                ans[i] = {r, r};
            }
            if(mapik[r] >= 2)
                gr.push_back(r);
        }
        sort(gr.begin(), gr.end());
        if(k == 0){
        long double minn = 1000000000;
        ll x, y;
        for(int j = 1; j < gr.size(); j++)
        {
            long double x1 = gr[j];
            long double x2 = gr[j - 1];
            long double cur = (long double) ((x1 * x1 + x2 * x2) / (x1 * x2));
            if(cur < minn){
                minn = cur;
                x = gr[j];
                y = gr[j - 1];
            }
        }
        ans[i] = {x, y};
        }
    }
    for(int i = 0; i < n; i++)
        cout << ans[i].first << ' ' << ans[i].first << ' ' << ans[i].second << ' ' << ans[i].second << endl;
}