Problem: You have n sticks of the given lengths.

Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be chosen multiple times. It is guaranteed that it is always possible to choose such sticks.

Let S be the area of the rectangle and P be the perimeter of the rectangle. 

The chosen rectangle should have the value (P^2)/(S) minimal possible. The value is taken without any rounding.

If there are multiple answers, print any of them.

Each testcase contains several lists of sticks, for each of them you are required to solve the problem separately.

Input

The first line contains a single integer T (T ≥ 1) — the number of lists of sticks in the testcase.

Then 2T lines follow — lines (2i - 1) and 2i of them describe the i-th list. The first line of the pair contains a single integer n (4 ≤ n ≤ 10^6) — the number of sticks in the i-th list. The second line of the pair contains n integers a_1, a_2, ..., a_n (1 ≤ a_j ≤ 10^4) — lengths of the sticks in the i-th list.

It is guaranteed that for each list there exists a way to choose four sticks so that they form a rectangle.

The total number of sticks in all T lists doesn't exceed 10^6 in each testcase.

Output

Print T lines. The i-th line should contain the answer to the i-th list of the input. That is the lengths of the four sticks you choose from the i-th list, so that they form a rectangle and the value (P^2)/(S) of this rectangle is minimal possible. You can print these four lengths in arbitrary order.

If there are multiple answers, print any of them.

Example

Input

3
4
7 2 2 7
8
2 8 1 4 8 2 1 5
5
5 5 5 5 5


Output

2 7 7 2
2 2 1 1
5 5 5 5

Note

There is only one way to choose four sticks in the first list, they form a rectangle with sides 2 and 7, its area is 2 ⋅ 7 = 14, perimeter is 2(2 + 7) = 18. (18^2)/(14) ≈ 23.143.

The second list contains subsets of four sticks that can form rectangles with sides (1, 2), (2, 8) and (1, 8). Their values are (6^2)/(2) = 18, (20^2)/(16) = 25 and (18^2)/(8) = 40.5, respectively. The minimal one of them is the rectangle (1, 2).

You can choose any four of the 5 given sticks from the third list, they will form a square with side 5, which is still a rectangle with sides (5, 5).

Solution (in JAVA):

Solution:
/**
 * Created by Baelish on 8/18/2018.
 */

import java.io.*;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;

public class C {
    public static void main(String[] args)throws Exception {
        FastReader in = new FastReader(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int test = in.nextInt();
        for(int t = 1; t <= test; t++) {
            int n = in.nextInt(), ans = -1;
            HashMap<Integer, Integer> map = new HashMap<>();
            for (int i = 1; i <= n; i++) {
                int x = in.nextInt(), y = 0;
                map.put(x, y = map.getOrDefault(x, 0)+1);
                if(y >= 4) ans = x;
            }
            if(ans != -1){
                pw.println(ans+" "+ans+" "+ans+" "+ans);
                continue;
            }

            TreeSet<Integer> set = new TreeSet<>();
            for (int i : map.keySet()) {
                if(map.get(i) >= 2) set.add(i);
            }

            Rational r = null;
            long ansX = -1, ansY = -1;

            for(int x : set){
                Integer y = set.higher(x);
                if(y != null){
                    Rational tmp = new Rational((x+y)*(x+y), (x*y));
                    if(r == null || r.compareTo(tmp) >= 0){
                        ansX = x; ansY = y;
                        r = tmp;
                    }
                }
            }

            pw.println(ansX+" "+ansX+" "+ansY+" "+ansY);

        }


        pw.close();
    }

    static class Rational implements Comparable<Rational> {
        static final Rational ZERO = new Rational(0, 1);

        long num, den;

        public Rational(long numerator, long denominator) {
            long g = gcd(numerator, denominator);
            num = numerator / g;
            den = denominator / g;

            // needed only for negative numbers
            if (den < 0) {
                den = -den;
                num = -num;
            }
        }

        // return the numerator and denominator of (this)
        public long numerator() {
            return num;
        }

        public long denominator() {
            return den;
        }

        // return double precision representation of (this)
        public double toDouble() {
            return (double) num / den;
        }

        // return string representation of (this)
        public String toString() {
            if (den == 1) return num + "";
            else return num + "/" + den;
        }

        // return { -1, 0, +1 } if a < b, a = b, or a > b
        public int compareTo(Rational b) {
            Rational a = this;
            BigInteger x = BigInteger.valueOf(a.num).multiply(BigInteger.valueOf(b.den)),
                    y = BigInteger.valueOf(a.den).multiply(BigInteger.valueOf(b.num));
            return x.compareTo(y);
        }

        // is this Rational object equal to y?
        public boolean equals(Object y) {
            if (y == null) return false;
            if (y.getClass() != this.getClass()) return false;
            Rational b = (Rational) y;
            return compareTo(b) == 0;
        }

        // hashCode consistent with equals() and compareTo()
        // (better to hash the numerator and denominator and combine)
        public int hashCode() {
            return this.toString().hashCode();
        }


        // create and return a new rational (r.num + s.num) / (r.den + s.den)
        public static Rational median(Rational r, Rational s) {
            return new Rational(r.num + s.num, r.den + s.den);
        }

        // return gcd(|m|, |n|)

        private static long gcd(long m, long n) {
            if (m < 0) m = -m;
            if (n < 0) n = -n;
            if (0 == n) return m;
            else return gcd(n, m % n);
        }

        // return lcm(|m|, |n|)
        private static long lcm(long m, long n) {
            if (m < 0) m = -m;
            if (n < 0) n = -n;
            return m * (n / gcd(m, n));    // parentheses important to avoid overflow
        }

        // return a * b, staving off overflow as much as possible by cross-cancellation
        public Rational multiply(Rational b) {
            Rational a = this;

            // reduce p1/q2 and p2/q1, then multiply, where a = p1/q1 and b = p2/q2
            Rational c = new Rational(a.num, b.den);
            Rational d = new Rational(b.num, a.den);
            return new Rational(c.num * d.num, c.den * d.den);
        }


        // return a + b, staving off overflow
        public Rational add(Rational b) {
            Rational a = this;

            // special cases
            if (a.compareTo(ZERO) == 0) return b;
            if (b.compareTo(ZERO) == 0) return a;

            // Find gcd of numerators and denominators
            long f = gcd(a.num, b.num);
            long g = gcd(a.den, b.den);

            // add cross-product terms for numerator
            Rational s = new Rational((a.num / f) * (b.den / g) + (b.num / f) * (a.den / g),
                    lcm(a.den, b.den));

            // multiply back in
            s.num *= f;
            return s;
        }

        // return -a
        public Rational negate() {
            return new Rational(-num, den);
        }

        // return |a|
        public Rational abs() {
            if (num >= 0) return this;
            else return negate();
        }

        // return a - b
        public Rational sub(Rational b) {
            Rational a = this;
            return a.add(b.negate());
        }


        public Rational reciprocal() {
            return new Rational(den, num);
        }

        // return a / b
        public Rational divide(Rational b) {
            Rational a = this;
            return a.multiply(b.reciprocal());
        }
    }

    static void debug(Object...obj) {
        System.err.println(Arrays.deepToString(obj));
    }

    static class FastReader {
        InputStream is;
        private byte[] inbuf = new byte[1024];
        private int lenbuf = 0, ptrbuf = 0;
        static final int ints[] = new int[128];

        public FastReader(InputStream is){
            for(int i='0';i<='9';i++) ints[i]=i-'0';
            this.is = is;
        }

        public int readByte(){
            if(lenbuf == -1)throw new InputMismatchException();
            if(ptrbuf >= lenbuf){
                ptrbuf = 0;
                try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
                if(lenbuf <= 0)return -1;
            }
            return inbuf[ptrbuf++];
        }

        public boolean isSpaceChar(int c) {
            return !(c >= 33 && c <= 126);
        }
        public int skip() {
            int b;
            while((b = readByte()) != -1 && isSpaceChar(b));
            return b;
        }

        public String next(){
            int b = skip();
            StringBuilder sb = new StringBuilder();
            while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public int nextInt(){
            int num = 0, b;
            boolean minus = false;
            while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
            if(b == '-'){
                minus = true;
                b = readByte();
            }

            while(true){
                if(b >= '0' && b <= '9'){
                    num = (num<<3) + (num<<1) + ints[b];
                }else{
                    return minus ? -num : num;
                }
                b = readByte();
            }
        }

        public long nextLong() {
            long num = 0;
            int b;
            boolean minus = false;
            while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
            if(b == '-'){
                minus = true;
                b = readByte();
            }

            while(true){
                if(b >= '0' && b <= '9'){
                    num = (num<<3) + (num<<1) + ints[b];
                }else{
                    return minus ? -num : num;
                }
                b = readByte();
            }
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
       /* public char nextChar() {
            return (char)skip();
        }*/

        public char[] next(int n){
            char[] buf = new char[n];
            int b = skip(), p = 0;
            while(p < n && !(isSpaceChar(b))){
                buf[p++] = (char)b;
                b = readByte();
            }
            return n == p ? buf : Arrays.copyOf(buf, p);
        }

        /*private char buff[] = new char[1005];
        public char[] nextCharArray(){
            int b = skip(), p = 0;
            while(!(isSpaceChar(b))){
                buff[p++] = (char)b;
                b = readByte();
            }
            return Arrays.copyOf(buff, p);
        }*/
    }
}