//知道不对但还是交了 
#include<bits/stdc++.h>
using namespace std;
const int N=200010;
int n;
int a[N];
int mark[N];
long long ans;
int tiao[N];
long long r;
bool flag=1;
int main()
{
    freopen("charger.in","r",stdin);
    freopen("charger.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(mark[a[i]]) tiao[mark[a[i]]]=i;
        mark[a[i]]=i;
    }
    r=n;
    for(int i=n-1;i>=1;i--)
        printf("%d ",tiao[i]);
    printf("\n");
    for(int i=n-1;i>=1;i--)
    {
        if(tiao[i]&&tiao[i]<=r)
        {
            r=tiao[i];
            ans++;
            flag=0;
        }
        ans+=r-i-1;
        if(flag) ans++;
        printf("%d ",ans);
    }
    printf("\n");
    printf("%lld",ans);
    return 0;
}