#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("scmax.in");
ofstream out("scmax.out");
int n;
int dp[100005];
int INF = 2e9 + 1;

int main()
{
    in>>n;

    dp[0] = 0;
    for(int i = 1; i<=n; i++)
    {
        dp[i] = INF;
    }

    int x;
    for(int i = 1; i<=n; i++)
    {
        in>>x;

        int best = lower_bound(dp, dp + n + 1, x) - dp;

        dp[best] = x;
    }

    for(int i = n; i>=0; i--)
    {
        if(dp[i] != INF)
        {
            out<<i<<'\n';

            for(int j = 1; j<=i; j++)
            {
                out<<dp[j]<<" ";
            }

            break;
        }
    }

    return 0;
}