#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream f("scmax.in");
ofstream g("scmax.out");

static constexpr int NMAX = (int)(1e5 + 1);

int n, nums[NMAX];

int v[NMAX], V[NMAX];

class FenwickTree
{
    int a[NMAX];
    int n;

private:
    static inline int my_max(int a, int b)
    {
        return ((a > b) ? a : b);
    }

    static inline int LSB(int x)
    {
        return ((x & (-x)));
    }

public:
    inline void Initialize(int m)
    {
        n = m;
        for (int i = 1; i <= n; ++i)
            a[i] = 0;
        return;
    }

    inline void Update(int pos, int val)
    {
        for (int i = pos; i <= n; i += LSB(i))
            a[i] = my_max(a[i], val);
        return;
    }

    inline int Query(int pos)
    {
        int ans = 0;
        for (int i = pos; i >= 1; i -= LSB(i))
            ans = my_max(ans, a[i]);
        return ans;
    }
} T;

static inline void Read()
{
    f.tie(nullptr);

    f >> n;
    for (int i = 1; i <= n; ++i)
        f >> nums[i], v[i] = nums[i];

    sort(v + 1, v + n + 1);

    V[0] = 0;
    V[++V[0]] = v[1];
    for (int i = 2; i <= n; ++i)
        if (v[i] != v[i - 1])
            V[++V[0]] = v[i];

    for (int i = 1; i <= n; ++i)
        nums[i] = (int)(lower_bound(V + 1, V + V[0] + 1, nums[i]) - V);

    return;
}

int main()
{
    Read();

    T.Initialize(V[0]);

    int dp[(n + 1)];
    for (int i = 1; i <= n; ++i)
        dp[i] = 1 + T.Query(nums[i] - 1), T.Update(nums[i], dp[i]);

    int ans = 0, pos = 0;
    for (int i = 1; i <= n; ++i)
        if (dp[i] > ans)
            ans = dp[i], pos = i;

    g << ans << '\n';

    vector<int> Sol;
    Sol.push_back(nums[pos]);

    --ans;

    int idx = pos;

    while (ans > 0)
    {
        if (dp[idx] == ans && nums[idx] < nums[pos])
            Sol.push_back(nums[idx]), --ans, pos = idx;

        --idx;
    }

    int m = (int)Sol.size();
    for (int i = (m - 1); i >= 0; --i)
    {
        g << V[Sol[i]];

        if (i > 0)
            g << ' ';
        else
            g << '\n';
    }

    return 0;
}