/*
TASK:fsort
LANG:C++
*/
#include<iostream>
using namespace std;
int a[1024],b[1024];
void reverse(int c){
     int i=0;int j=c;
     while(i<j){
                swap(a[i],a[j]);
                i++;
                j--;}}
int searchc(int x,int c){
     for(int i=1;i<c;i++) if(a[i]==x) return i;}
                     
int main(){
    int n;
    cin >> n;
    for(int i=0;i<n;i++){ cin >> a[i];b[i]=a[i];}
    sort(b,b+n);
    n--;
    for(int i=n;i>=0;i--){
            if(a[i]!=b[i]){
            if(a[0]==b[i]){cout << i+1 << ' ';reverse(i);} else{
                           int s=searchc(b[i],i);
                           reverse(s);
                           cout << s+1 << ' ';
                           reverse(i);
                           cout << i+1 << ' ';}}}
    cout << endl;
    return 0;
}
