/*
TASK:fsort
LANG:C++
*/
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a,b;
    int n,q;
    void print()
    {
         for(int i=0;i<n;i++)
         cout<<a[i]<<" ";
         cout<<endl;
     }
int find(int w)
{
    for(int i=0;i<n;i++)
    if(a[i]==w) return i;
    return -1;
}
void reverse(int w)
{
     int z=w/2+w%2;
     int temp;
     for(int i=0;i<z;i++)
     {
     temp=a[i];
     a[i]=a[w-i];
     a[w-i]=temp;        
     }
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
    cin>>q;
    a.push_back(q);
    b.push_back(q);
    }
    sort(b.begin(),b.end());
    for(int i=n-1;i>=0;i--)
    {
    int w=find(b[i]);
    if(w==i) continue;
    if(w) {reverse(w);cout<<w+1<<" ";
}
    cout<<i+1<<" ";
    reverse(i);        
    }
    cout<<endl;
    //system("pause");
    return 0;
}
