/*
TASK:fsort
LANG:c++
*/


#include <iostream>



using namespace std;
int main()
{
 int n,k=0,t,br=0;;
 cin>>n;
 int a[n];
 for(int i=0;i<n;i++)
 cin>>a[i];
 int max=a[0];
 for(int i=0;i<n;i++)
 if(max<a[i]){max=a[i];k=i;}
 if(k!=n-1){if(k!=0){
  for(int i=0;i<=k/2;i++)
 {
  t=a[i];a[i]=a[k-i];a[k-i]=t;
 }}if(k!=0)cout<<k+1<<" ";
  k=n-1;
  if(k!=0)cout<<k+1<<" ";
   for(int i=0;i<=k/2;i++)
  {
   t=a[i];a[i]=a[k-i];a[k-i]=t;
  }}
 int p=n-1; 
 do
 {
  max=a[0];br=0;k=0;
  for(int i=0;i<p;i++)
  if(max<=a[i]){max=a[i];k=i;}
   
  for(int i=0;i<=k/2;i++)
 {
  t=a[i];a[i]=a[k-i];a[k-i]=t;
 }
  if(k!=0)cout<<k+1<<" ";
  k=p-1;
 if(k!=0) cout<<k+1<<" ";
   for(int i=0;i<=k/2;i++)
  {
   t=a[i];a[i]=a[k-i];a[k-i]=t;
 }
  for(int i=0;i<n-1;i++)
  if(a[i]>a[i+1])br++;p--;
 }while(br!=0);
cout<<"\n";
 


 


return 0;
}
