/*
TASK:FSORT
LANG:C++
*/
#include<iostream>
using namespace std;
int n,a[1001],i,m,k,l,q,r,b[10000],br=0;
void move(int p){
    int t;
    for(int j=1;j<=p/2;j++){t=a[j];a[j]=a[p-j+1];a[p-j+1]=t;}
    //for(l=1;l<=q;l++){cout<<a[l]<<" ";}
    //cout<<"\n";
    //system("pause");
    return;
    
}
int is_sorted(){
    for(int j=1;j<q;j++)if(a[j]>a[j+1]){return 0;}
    return 1;
}
int main()
{
   cin>>n;
   q=n;
   for(i=1;i<=n;i++){cin>>a[i];}
   while(is_sorted()==0){
        m=-1;
        r=0;
        for(k=1;k<n;k++)if(a[k]>m){m=a[k];r=k;}        
        move(r);        
        br++;
        b[br]=r;
        move(n);
        br++;
        b[br]=n;
        n--;
        }
        for(l=1;l<=br;l++){if(b[l]!=1){cout<<b[l];if(l!=br)cout<<" ";}}
    cout<<"\n";
    return 0;
}
        
        
