/*
TASK: fsort
LANG: C++
*/
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;

long n,k,m;

int main()
{ 
 cin>>n;
 long p,a[1001],b[1001],c[1001],i,j,l,k1,ifsrt=0,flag=0;
 
 for(i=1;i<=n;i++)
 cin>>a[i];
 
 for(j=1;j<=n;j++) c[j]=a[j];
 
 sort(c,c+n+1);
 
 while(1)
 {//while

   if(a[1]>a[2]) m=1;
   else m=-1;
   
   if(m==1)
   {
   for(j=1;j<=n;j++)
   if(a[j]<a[j+1]) {k=j;break;}
   }
   
   if(m==-1)
   {
   for(j=1;j<=n;j++) {   if(a[j]>a[j+1]) {k=j;break;}    }
   }
   
   for(j=1;j<=n;j++)
   if(a[j]!=c[j]) flag=1;
   
   if(flag==0) break;
   
   flag=0;
   
   if(k==k1 && k1==5) break;

   if(k==k1 && k1!=5) k=n;
   if(ifsrt==0) cout<<k;
   else cout<<" "<<k;

   
   for(j=1;j<=n;j++) b[j]=a[j];
   p=1;
   for(j=k;j>=1;j--) {    b[p]=a[j];  p++;   }
   for(j=1;j<=n;j++) a[j]=b[j];
   
  
   
   k1=k;
   m=0;

ifsrt++;

 }//while
   
 cout<<"\n";
return 0;
}
