/*
TASK:fsort
LANG:C++
*/
#include<cstdio>
#include<algorithm>
using namespace std;

int find_max_in_to(int arr[], int last)
{
    int max=-2000000000, idx=1;
    for(int i=1; i<=last; i++)
    {
        if(arr[i]>max){max=arr[i]; idx=i;}
    }
    return idx;
}

int main()
{
    int a[1024];
    int n;
    scanf("%d", &n);
    for(int i=1;i<=n; i++) scanf("%d", &a[i]);
    int fin=n, idx;
    idx=find_max_in_to(a,fin);
    printf("%d %d", idx, fin);
    reverse(a+1, a+idx+1);
    reverse(a+1, a+fin+1);
    fin--;
    while(fin>1)
    {
        idx=find_max_in_to(a,fin);
        if(idx!=1 && idx!=fin)
        {
            printf(" %d %d", idx, fin);
            reverse(a+1, a+idx+1);
            reverse(a+1, a+fin+1);
        }
        
        if(idx==1)
        {
            printf(" %d", fin);
            reverse(a+1, a+fin+1);
        }
        fin--;
    }
    printf("\n");
    return 0;
}
