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 CPP):

Solution:
#include <bits/stdc++.h>
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = 1 << 29;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
template <class T>
void chmax(T &a, const T &b) {
  a = max(a, b);
}
template <class T>
void chmin(T &a, const T &b) {
  a = min(a, b);
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int max(long long int a, long long int b) {
  if (a > b) return a;
  return b;
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long int powermod(long long int x, long long int y) {
  long long int res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y >> 1;
    x = (x * x) % 1000000007;
  }
  return res;
}
int maxSubArraySum(int a[], int size) {
  int max_so_far = INT_MIN, max_ending_here = 0;
  for (int i = 0; i < size; i++) {
    max_ending_here = max_ending_here + a[i];
    if (max_so_far < max_ending_here) max_so_far = max_ending_here;
    if (max_ending_here < 0) max_ending_here = 0;
  }
  return max_so_far;
}
long long mulmod(long long a, long long b) {
  long long res = 0;
  a %= 1000000007;
  while (b) {
    if (b & 1) res = (res + a) % 1000000007;
    a = (2 * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i += 6) {
    if ((n % i == 0) || (n % (i + 2) == 0)) return false;
  }
  return true;
}
long double dist(long long int x1, long long int y1, long long int x2,
                 long long int y2) {
  return (long double)sqrt(
      (long double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
long long int squaredist(long long int x1, long long int y1, long long int x2,
                         long long int y2) {
  return ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
long long int nCr(long long int n, long long int r) {
  if (r == 0) return 1;
  return (n * nCr(n - 1, r - 1)) / r;
}
long long int countDivisors(long long int n) {
  long long int cnt = 0;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        cnt++;
      else
        cnt = cnt + 2;
    }
  }
  return cnt;
}
int xorRange(int x, int y) {
  if (x % 2 == 0) {
    int pattern[] = {y, 1, y + 1, 0};
    return pattern[(int)((y - x) % 4)];
  } else {
    int pattern[] = {x, x ^ y, x - 1, (x - 1) ^ y};
    return pattern[(int)((y - x) % 4)];
  }
}
using namespace std;
void bfs(std::vector<int> v[], int n, int a[]) {
  int c = 0;
  bool visited[n + 1];
  int level[n + 1];
  for (int i = 0; i < n + 1; ++i) {
    visited[i] = false;
  }
  queue<int> vv;
  vv.push(1);
  level[1] = 0;
  visited[1] = true;
  int s;
  while (!vv.empty()) {
    s = vv.front();
    vv.pop();
    for (int i = 0; i < v[s].size(); ++i) {
      if (!visited[v[s][i]]) {
        level[v[s][i]] = level[s] + 1;
        visited[v[s][i]] = true;
        vv.push(v[s][i]);
      }
    }
  }
  int m = INT_MAX, j = 0;
  for (int i = 2; i < n + 1; ++i) {
    if (a[i] == 1 && m > level[i]) {
      m = level[i];
      j = i;
    }
  }
  cout << j;
}
void dfs(std::vector<int> v[], bool visited[], int node) {
  visited[node] = true;
  for (int next : v[node]) {
    if (visited[next] == false) {
      dfs(v, visited, next);
    }
  }
}
vector<int> initializeDiffArray(vector<int> &A) {
  int n = A.size();
  vector<int> D(n + 1);
  D[0] = A[0], D[n] = 0;
  for (int i = 1; i < n; i++) D[i] = A[i] - A[i - 1];
  return D;
}
void update(vector<int> &D, int l, int r, int x) {
  D[l] += x;
  D[r + 1] -= x;
}
int printArray(vector<int> &A, vector<int> &D) {
  for (int i = 0; i < A.size(); i++) {
    if (i == 0)
      A[i] = D[i];
    else
      A[i] = D[i] + A[i - 1];
    cout << A[i] << " ";
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    long long ans = 0;
    vector<long long> v;
    for (long long i = 0; i < n - 1; i++) {
      if (v.size() == 0) {
        v.push_back(a[0]);
        ans++;
      } else if ((a[i] < a[i + 1] && a[i] > v[v.size() - 1]) ||
                 (a[i] > a[i + 1] && a[i] < v[v.size() - 1])) {
        continue;
      } else {
        v.push_back(a[i]);
        ans++;
      }
    }
    if (v[v.size() - 1] != a[n - 1]) {
      v.push_back(a[n - 1]);
      ans++;
    }
    cout << ans << "\n";
    for (long long i = 0; i < ans; i++) {
      cout << v[i] << " ";
    }
    cout << "\n";
  }
  return 0;
}