Problem: Given a permutation p of length n, find its subsequence s_1, s_2, …, s_k of length at least 2 such that:

  * |s_1-s_2|+|s_2-s_3|+…+|s_{k-1}-s_k| is as big as possible over all subsequences of p with length at least 2. 
  * Among all such subsequences, choose the one whose length, k, is as small as possible. 



If multiple subsequences satisfy these conditions, you are allowed to find any of them.

A sequence a is a subsequence of an array b if a can be obtained from b by deleting some (possibly, zero or all) elements.

A permutation of length n is an array of length n in which every element from 1 to n occurs exactly once.

Input

The first line contains an integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n (2 ≤ n ≤ 10^5) — the length of the permutation p.

The second line of each test case contains n integers p_1, p_2, …, p_{n} (1 ≤ p_i ≤ n, p_i are distinct) — the elements of the permutation p.

The sum of n across the test cases doesn't exceed 10^5.

Output

For each test case, the first line should contain the length of the found subsequence, k. The second line should contain s_1, s_2, …, s_k — its elements.

If multiple subsequences satisfy these conditions, you are allowed to find any of them.

Example

Input


2
3
3 2 1
4
1 3 4 2


Output


2
3 1 
3
1 4 2 

Note

In the first test case, there are 4 subsequences of length at least 2:

  * [3,2] which gives us |3-2|=1. 
  * [3,1] which gives us |3-1|=2. 
  * [2,1] which gives us |2-1|=1. 
  * [3,2,1] which gives us |3-2|+|2-1|=2. 



So the answer is either [3,1] or [3,2,1]. Since we want the subsequence to be as short as possible, the answer is [3,1].

Solution (in JAVA):

Solution:
import java.io.PrintStream;
import java.util.*;

public class CF649 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PrintStream printStream = new PrintStream(System.out);
        new ProblemB().solve(scanner, printStream);
    }
}

class Utils {
    public static int[] readIntArray(Scanner scanner, int n) {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = scanner.nextInt();
        }
        return res;
    }

    public static void println(PrintStream printStream, List a) {
        for (Object x : a) {
            printStream.print(x + " ");
        }
        printStream.println();
    }
}

class ProblemA {
    void solve(Scanner scanner, PrintStream printStream) {
        for (int times = scanner.nextInt(); times >= 1; times--) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();
            int[] a = new int[n];
            int[] place = new int[x];
            TreeSet<Integer> set = new TreeSet<>();
            for (int i = 0; i < x; i++) {
                place[i] = -1;
            }
            for (int i = 0; i < n; i++) {
                a[i] = scanner.nextInt();
            }
            a[0] %= x;
            int ans = a[0] == 0 ? -1 : 1;
            place[a[0]] = 0;
            set.add(0);
            for (int i = 1; i < n; i++) {
                a[i] = (a[i] + a[i - 1]) % x;
                if (a[i] != 0) {
                    ans = Math.max(ans, i + 1);
                }
                if (place[a[i]] != -1) {
                    set.remove(place[a[i]]);
                    if (!set.isEmpty()) {
                        ans = Math.max(ans, i - set.first());
                    }
                    set.add(place[a[i]]);
                } else {
                    place[a[i]] = i;
                    set.add(i);
                }
            }
            printStream.println(ans);
        }
    }
}

class ProblemB {
    void solve(Scanner scanner, PrintStream printStream) {
        for (int times = scanner.nextInt(); times >= 1; times--) {
            int n = scanner.nextInt();
            int[] p = Utils.readIntArray(scanner, n);
            List<Integer> ans = new ArrayList<>();
            ans.add(p[0]);
            if (n >= 1) {
                ans.add(p[1]);
            }
            for (int i = 2; i < n; i++) {
                int sz = ans.size();
                if (ans.get(sz - 1) > ans.get(sz - 2)) {
                    if (p[i] > ans.get(sz - 1)) {
                        ans.set(sz - 1, p[i]);
                    } else {
                        ans.add(p[i]);
                    }
                } else {
                    if (p[i] > ans.get(sz - 1)) {
                        ans.add(p[i]);
                    } else {
                        ans.set(sz - 1, p[i]);
                    }
                }
            }
            printStream.println(ans.size());
            Utils.println(printStream, ans);
        }
    }
}