#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <fstream>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

void Lungime(vector<int>& nums)
{
    int n = nums.size();

    vector<vector<int>> dp(n, vector<int>(2));
    int ans = 0, Finish = 0;

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

        for (int j = 0; j < i; j++)
        {
            if (nums[j] < nums[i] && dp[j][0] > MaxSmaller)
            {
                MaxSmaller = dp[j][0];
                dp[i][1] = j;
            }
        }

        dp[i][0] = MaxSmaller + 1;
        
        if (dp[i][0] > ans)
        {
            ans = dp[i][0];
            Finish = i;
        }
    }

    fout << ans << '\n';

    vector<int> Sir;
    while (dp[Finish][1] != -1)
    {
        Sir.push_back(nums[Finish]);
        Finish = dp[Finish][1];
    }
    Sir.push_back(nums[Finish]);

    for (int i = (int)Sir.size() - 1; i >= 0; i--)
    {
        fout << Sir[i] << ' ';
    }
}

int main()
{
    int n;
    fin >> n;

    vector<int> nr(n);
    for (int& x : nr)
    {
        fin >> x;
    }

    Lungime(nr);
}

/*
    
    poz: -1 0 1 2 3 4 5 6 7 -1 9 10 11 12 13 14 15 16 17
    v  :  2 3 4 5 6 7 8 9 10 1 2  3  4  5  6  7  8  9  10
    dp : 

    24 12 15 15 19
    -1 -1  1  1  2
*/