Snuke has a sequence p, which is a permutation of (0,1,2, ...,N-1). The i-th element (0-indexed) in p is p_i.

He can perform N-1 kinds of operations labeled 1,2,...,N-1 any number of times in any order. When the operation labeled k is executed, the procedure represented by the following code will be performed:


for(int i=k;i<N;i++)
swap(p[i],p[i-k]);


He would like to sort p in increasing order using between 0 and 10^{5} operations (inclusive). Show one such sequence of operations. It can be proved that there always exists such a sequence of operations under the constraints in this problem.

Constraints

* 2 \leq N \leq 200
* 0 \leq p_i \leq N-1
* p is a permutation of (0,1,2,...,N-1).

Input

Input is given from Standard Input in the following format:


N
p_0 p_1 ... p_{N-1}


Output

Let m be the number of operations in your solution. In the first line, print m. In the i-th of the following m lines, print the label of the i-th executed operation. The solution will be accepted if m is at most 10^5 and p is in increasing order after the execution of the m operations.

Examples

Input

5
4 2 0 1 3


Output

4
2
3
1
2


Input

9
1 0 4 3 5 6 2 8 7


Output

11
3
6
1
3
5
2
4
7
8
6
3
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=500000004;
const double EPS=1e-10;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
int p[210];
int q[210];
vector<pair<int,int> > mr;
int N;
void wolf(int a){
    for(int i=a;i<N;i++)swap(p[i],p[i-a]);
   // printf("%d: ",a);
    for(int i=0;i<N;i++){
       // if(i)printf(" ");
     //   printf("%d",p[i]);
    }
   // printf("\n");
}
int main(){
    int a;scanf("%d",&a);
    N=a;
    for(int i=0;i<a;i++){scanf("%d",p+i);}
    for(int i=0;i<a;i++)q[i]=p[i];
    for(int i=0;i<a;i++){
        for(int j=1;j<a;j++){
            if(q[j]<q[j-1]){
                mr.push_back(make_pair(j-1,j));
                swap(q[j],q[j-1]);
            }
        }
    }
    vector<int>ret;
    int ori=0;
    for(int i=0;i<mr.size();i++){
        int L=mr[i].first;
        int rem=(L+1-ori+a)%a;
        while(rem){
            int mv=min(rem,1);
            ret.push_back(mv);
            wolf(mv);
            rem-=mv;
        }
        ret.push_back(a-1);
        wolf(a-1);
        ori=(L+1)%a;
 
    }
    int rem=(a-ori)%a;
    while(rem){
        int mv=min(rem,1);
        ret.push_back(mv);
        wolf(mv);
        rem-=mv;
    }
    assert(ret.size()<=100000);
    printf("%d\n",ret.size());
    for(int i=0;i<ret.size();i++){
        printf("%d\n",ret[i]);
    }
}