#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,ll> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn = +;

 int n ,top;

 int a[maxn],pre[maxn],nxt[maxn];

 int que[maxn];

 template <class T>

 inline void scan_d(T &ret)

 {

     char c;

     ret = ;

     while ((c = getchar()) < '' || c > '');

     while (c >= '' && c <= '')

     {

         ret = ret *  + (c - ''), c = getchar();

     }

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int T;

     scan_d(T);

     while(T--)

     {

         top=;

         scan_d(n);

         for(int i=;i<=n;i++)

         {

             scan_d(a[i]);

             pre[i]=i-;

             nxt[i]=i+;

             que[top++]=i;

         }

         a[]=,a[n+]=INF;

         nxt[]=,pre[n+]=n;

         bool flag = true;

         int ans = n;

         while(flag)

         {

             int s = ;

             flag = false;

             int now = ;

             while(now<top)

             {

                 int cnt = ;

                 int it = que[now];

                 while(a[it]>a[nxt[it]])  {cnt++;it=nxt[it];flag=true;}

                 if(cnt)

                 {

                     ans-=(cnt+);

                     nxt[pre[que[now]]]=nxt[it];

                     pre[nxt[it]]=pre[que[now]];

                     que[s++]=pre[que[now]];;

                 }

                 while(que[now]<=it && now<top) now++;

             }

             top=s;

         }

         printf("%d\n",ans);

         for(int i=;nxt[i]!=n+;i=nxt[i])

             printf("%d ",a[nxt[i]]);

         printf("\n");

     }

     return ;

 }