#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n;
vector<int> A,P;
vector<int> D;
void secventa(int i,int k,int last)
{
    if(k==0)
      return;
    else
      for(int j=i;j>=1;j--)
         if(P[j]==k && last>A[j])
         {
             secventa(j-1,k-1,A[j]);
             cout<<A[j]<<" ";
             return;
         }
}
int main()
{
    cin>>n;
    A.resize(n+1);
    P.resize(n+1);
    for(int i=1;i<=n;i++)
      cin>>A[i];
    D.push_back(A[1]);
    P[1]=1;
    for(int i=2;i<=n;i++)
    {
      if(A[i]>D[D.size()-1])
      {
        D.push_back(A[i]);
        P[i]=D.size();
      }
     else
     {
       int o=upper_bound(D.begin(),D.end(),A[i])-D.begin();
       D[o]=A[i];
       P[i]=o+1;
     }
    }
    int maxi=0;
    for(int i=1;i<=n;i++)
       maxi=max(maxi,P[i]);
    cout<<maxi<<'\n';
    secventa(n,maxi,2000000001);
    return 0;
}