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].
import java.util.*;
import java.io.*;

public class Solution{
	long rem = 1000000000L;
	InputReader sc;
	boolean singleTest = false;
	
	public void solve(int test){
		int n = nextInt();
		
		int[] p = nextArrInt(n);
		
		int el = p[0];
		ArrayList<Integer> res = new ArrayList<Integer>();
		res.add(el);
		
		boolean inc = true;
		
		if(p[1] < el){
			inc = false;
		}
		el = p[1];
		
		for(int i=2; i<n; i++){
			if(inc && (p[i] > el)){
				el = p[i];
			}
			else if(!inc && (p[i] < el)){
				el = p[i];
			}
			else{
				res.add(el);
				el = p[i];
				inc = !inc;
			}
		}
		res.add(el);
		
		println(res.size());
		for(int i : res){
			print(i + " ");
		}
		println("");
	}
	
	
	
	
	
	
	
	
	
	
	
	public int[] initialize(int[] arr, int len, int val){
		for(int i=0; i<len; i++){
			arr[i] = val;
		}
		return arr;
	}
	public long[] initialize(long[] arr, int len, long val){
		for(int i=0; i<len; i++){
			arr[i] = val;
		}
		return arr;
	}
	public boolean[] initialize(boolean[] arr, int len, boolean val){
		for(int i=0; i<len; i++){
			arr[i] = val;
		}
		return arr;
	}
	public int[] initialize(int[] arr, int val){
		return initialize(arr, arr.length, val);
	}
	public long[] initialize(long[] arr, long val){
		return initialize(arr, arr.length, val);
	}
	public boolean[] initialize(boolean[] arr, boolean val){
		return initialize(arr, arr.length, val);
	}
	
	public int nextInt(){
		return sc.nextInt();
	}
	public long nextLong(){
		return sc.nextLong();
	}
	public String next(){
		return sc.next();
	}
	public String nextLine(){
		return sc.nextLine();
	}
	public int[] nextArrInt(int n){
		int[] arr = new int[n];
		for(int i=0; i<n; i++){
			arr[i] = nextInt();
		}
		return arr;
	}
	public long[] nextArrLong(int n){
		long[] arr = new long[n];
		for(int i=0; i<n; i++){
			arr[i] = nextLong();
		}
		return arr;
	}
	public String[] nextArrWord(int n){
		String[] arr = new String[n];
		for(int i=0; i<n; i++){
			arr[i] = next();
		}
		return arr;
	}
	
	public void println(String str){
		System.out.println(str);
	}
	public void println(int num){
		System.out.println(num);
	}
	public void println(long num){
		System.out.println(num);
	}
	public void print(String str){
		System.out.print(str);
	}
	public void print(int num){
		System.out.print(num);
	}
	public void print(long num){
		System.out.print(num);
	}
	public void printArr(int[] arr){
		int n = arr.length;
		for(int i=0; i<(n-1); i++){
			print(arr[i] + " ");
		}
		println(arr[n-1]);
	}
	public void printArr(int[] arr, int n){
		print(n+" ");
		for(int i=0; i<(n-1); i++){
			print(arr[i] + " ");
		}
		println(arr[n-1]);
	}
	public void printArr(long[] arr){
		int n = arr.length;
		for(int i=0; i<(n-1); i++){
			print(arr[i] + " ");
		}
		println(arr[n-1]);
	}
	public void printArr(long[] arr, int n){
		print(n+" ");
		for(int i=0; i<(n-1); i++){
			print(arr[i] + " ");
		}
		println(arr[n-1]);
	}
	
	public Solution(){
		sc = new InputReader();
		
		int tests = 1;
		if(!singleTest){
			tests = sc.nextInt();
		}
        
        for(int t=1; t<=tests; t++){
			solve(t);
        }
	}
	
	public static void main(String[] args){
		new Solution();
	}
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
	
	public InputReader(){
		InputStream stream = System.in;
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }
	
    public InputReader(InputStream stream){
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }
 
    public String next(){
        while(tokenizer == null || !tokenizer.hasMoreTokens()) {
            try{
                tokenizer = new StringTokenizer(reader.readLine());
            }catch(IOException e){
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
 
    public int nextInt(){
        return Integer.parseInt(next());
    }
	
	public long nextLong(){
		return Long.parseLong(next());
	}
	
	public String nextLine(){
		try{
			return reader.readLine();
		}catch(IOException e){
			throw new RuntimeException(e);
		}
	}
}