#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[10] = {0,1,3,2,7,8};
int dp[10]; // dp[i] 表示以ai结尾的最大值
int p[10];
void dfs(int pos)
{
if(p[pos] == -1) return;
dfs(p[pos]);
cout << a[pos] << endl;
}
int main()
{
memset(dp,0,sizeof(dp));
memset(p,-1,sizeof(p));
for(int i=1;i<=5;i++)
{
for(int j=1;j<i;j++)
{
if(dp[i] < dp[j] + 1)
{
dp[i] = dp[j] + 1;
p[i] = j;
}
}
}
int maxs = -1;
int pos;
for(int i=1;i<=5;i++)
{
if(maxs < dp[i])
{
maxs = dp[i];
pos = i;
}
}
cout << maxs << endl;
dfs(pos);
return 0;
}