#include<bits/stdc++.h>
#include"cnoi.h"
using namespace std;using ll=long long;
int rd(int x=0,char c=getchar()){int f=1;while(!isdigit(c))f=(c^'-'?1:-1),c=getchar();while(isdigit(c))x=x*10+(c^48),c=getchar();return x*f;}
const int N=1e3+3;
int n,a[N],s[N],S,c[N];
using ull=unsigned long long;
const ull pw=131;
ull h[N];
map<ull,int> mp;
vector<int> solve(int n){
a[1]=s[1]=h[1]=++S;mp[1]=1;
for(int i=2;i<=n;i++){
int l=1,r=i,p=1;
while(l<=r){
int mid=(l+r)>>1;
int x=query(mid,i);
if(x==s[mid]+i-mid+1)p=mid,r=mid-1;
else l=mid+1;
}
if(p==1)a[i]=++S;
else a[i]=a[p-1];
ull x=0;
for(int j=i;j;j--){
x=x*pw+a[j];
c[mp[x]+1]++;c[j+1]--;
mp[x]=j;
}
for(int j=1;j<=i;j++)c[j]+=c[j-1],s[j]+=c[j];
for(int j=1;j<=i+1;j++)c[j]=0;
}
vector<int> A;
for(int i=1;i<=n;i++)A.push_back(a[i]);
return A;
}