#include <iostream>
#include <fstream>
#include <cstring>
#include <stack>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int INF = 1e9;
int n, m, counter;
int v[100100], previous[100100], small[100100];
stack<int> ans;
int binarySearch(int value, int left, int right)
{
int mid;
while(left <= right)
{
mid = (left + right) / 2;
if(v[small[mid]] <= value)
left = mid + 1;
else
right = mid - 1;
}
return right;
}
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
v[0] = 0;
small[1] = 1;
previous[1] = 0;
counter = 1;
for(int i = 1; i <= n; i++)
{
if(v[i] > v[small[counter]])
{
counter++;
small[counter] = i;
previous[i] = small[counter - 1];
}
else
{
int x = binarySearch(v[i], 0, counter);
previous[i] = small[x];
small[x + 1] = i;
}
}
out << counter << '\n';
int p = small[counter];
while(p != 0)
{
ans.push(v[p]);
p = previous[p];
}
while(!ans.empty())
{
out << ans.top() << ' ';
ans.pop();
}
return 0;
}