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:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.HashMap;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
        public static void main(String[] args) {
                new Thread(null, new Runnable() {
                        public void run() {
                                new Main().solve();
                        }
                }, "1", 1 << 26).start();
        }

        void solve() {
                InputStream inputStream = System.in;
                OutputStream outputStream = System.out;
                ScanReader in = new ScanReader(inputStream);
                PrintWriter out = new PrintWriter(outputStream);
                CMinimumValueRectangle solver = new CMinimumValueRectangle();
                int testCount = in.scanInt();
                for (int i = 1; i <= testCount; i++)
                        solver.solve(i, in, out);
                out.close();
        }

        static class CMinimumValueRectangle {
                public void solve(int testNumber, ScanReader in, PrintWriter out) {
                        int n = in.scanInt();
                        HashSet<Integer> set = new HashSet<>();
                        HashMap<Integer, Integer> map = new HashMap<>();
                        for (int i = 0; i < n; i++) {
                                int tt = in.scanInt();
                                set.add(tt);
                                if (!map.containsKey(tt)) map.put(tt, 0);
                                map.put(tt, map.get(tt) + 1);
                        }
                        int size = 0;
                        for (int i : set) if (map.get(i) >= 2) size++;
                        int[] ar = new int[size];
                        size = 0;
                        for (int i : set) if (map.get(i) >= 2) ar[size++] = i;
                        CodeHash.Radix_Sort(ar);
                        double max = 100000d;
                        int aa = -1;
                        int bb = -1;
                        for (int i = 0; i < size; i++) {
                                if (map.get(ar[i]) >= 4 && max >= 2) {
                                        max = 2;
                                        aa = ar[i];
                                        bb = ar[i];
                                }
                                if (i != 0) {
                                        if (max >= (ar[i] / (double) ar[i - 1]) + (ar[i - 1] / (double) ar[i])) {
                                                max = (ar[i] / (double) ar[i - 1]) + (ar[i - 1] / (double) ar[i]);
                                                aa = ar[i];
                                                bb = ar[i - 1];
                                        }
                                }
                                if (i != size - 1) {
                                        if (max >= (ar[i] / (double) ar[i + 1]) + (ar[i + 1] / (double) ar[i])) {
                                                max = (ar[i] / (double) ar[i + 1]) + (ar[i + 1] / (double) ar[i]);
                                                aa = ar[i];
                                                bb = ar[i + 1];
                                        }
                                }

                        }
                        out.println(aa + " " + aa + " " + bb + " " + bb + " ");
                }

        }

        static class ScanReader {
                private byte[] buf = new byte[4 * 1024];
                private int index;
                private BufferedInputStream in;
                private int total;

                public ScanReader(InputStream inputStream) {
                        in = new BufferedInputStream(inputStream);
                }

                private int scan() {
                        if (index >= total) {
                                index = 0;
                                try {
                                        total = in.read(buf);
                                } catch (Exception e) {
                                        e.printStackTrace();
                                }
                                if (total <= 0) return -1;
                        }
                        return buf[index++];
                }

                public int scanInt() {
                        int integer = 0;
                        int n = scan();
                        while (isWhiteSpace(n)) n = scan();
                        int neg = 1;
                        if (n == '-') {
                                neg = -1;
                                n = scan();
                        }
                        while (!isWhiteSpace(n)) {
                                if (n >= '0' && n <= '9') {
                                        integer *= 10;
                                        integer += n - '0';
                                        n = scan();
                                }
                        }
                        return neg * integer;
                }

                private boolean isWhiteSpace(int n) {
                        if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
                        else return false;
                }

        }

        static class CodeHash {
                public static void Radix_Sort(int a[]) {

                        int multiplier = 1, len = a.length, max = Integer.MIN_VALUE;
                        int b[] = new int[len];
                        int bucket[];
                        for (int i = 0; i < len; i++) if (max < a[i]) max = a[i];
                        while (max / multiplier > 0) {
                                bucket = new int[10];
                                for (int i = 0; i < len; i++) bucket[(a[i] / multiplier) % 10]++;
                                for (int i = 1; i < 10; i++) bucket[i] += (bucket[i - 1]);
                                for (int i = len - 1; i >= 0; i--) b[--bucket[(a[i] / multiplier) % 10]] = a[i];
                                for (int i = 0; i < len; i++) a[i] = b[i];
                                multiplier *= 10;
                        }

                }

        }
}