#include <bits/stdc++.h>
#define N 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[N],best[N],p,lg[N];
///best[i]=capatul minim unui subsir crescator de lg i
void Afisare(int x)
{
    if(p)
    if(lg[x]==p)
    {
        p--;
        Afisare(x-1);
        fout<<a[x]<<" ";
    }
    else Afisare(x-1);
}
int main()
{
    int i,j,poz,lgmax;
    fin>>n;
    for(i=1;i<=n;i++) fin>>a[i];
    best[p=1]=a[1]; lg[1]=1;
    for(i=2;i<=n;i++)
        if(a[i]>best[p]) best[++p]=a[i],lg[i]=p;
        else poz=upper_bound(best+1,best+p+1,a[i])-best,best[poz]=a[i],lg[i]=poz;
    fout<<p<<"\n";
    for(i=1;i<=p;i++) cout<<best[i]<<" ";cout<<"\n";
    for(i=1;i<=n;i++) cout<<lg[i]<<" ";cout<<"\n";
    Afisare(n);
    return 0;
}