/*
TASK:fsort
LANG:C++
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
#include <stdlib.h>
#define FOR(i,n) for(i=0;i<n;i++)
#define FoR(i,n) for(i=n-1;i>=0;i--)
#define pb push_back
using namespace std;

int main()
{
    int N;
    cin >> N;
    long a[N];
    int ans[1000000];
    int k=0;
    int i,j;
    FOR(i,N)
        cin >> a[i];
    while(N>1)
    {
        long max=-2000000000;
        int maxid=-1;
        FOR(i,N)
            if (a[i]>max){max=a[i]; maxid=i;}
        if (maxid>0)
        {
           ans[k]=maxid+1;
           k++;
           for (i=0,j=maxid;i<(maxid+1)/2;i++,j--)
           {
                long long h=a[i];
                a[i]=a[j];
                a[j]=h;
            }
        }
        else
        {
            ans[k]=N;
            k++;
            for (i=0,j=N-1;i<N/2;i++,j--)
           {
                long long h=a[i];
                a[i]=a[j];
                a[j]=h;
            }
            N--;
        }
    }
    FOR(i,k-1)
        cout << ans[i] << " ";
    cout << ans[i] << "\n";
return 0;
}
    
            
