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 <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <cstring>
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <list>  
#include <cassert>
#include <ctime>
#include <climits>
using namespace std;  

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }

const int MAXN = 200;
const int MAXRET = 100000;

int n;
int p[MAXN];

int ret[MAXRET], nret;
void addret(int x) { assert(nret < MAXRET); ret[nret++] = x; }

void run() {
	scanf("%d", &n); REP(i, n) scanf("%d", &p[i]);
	//n = 200; REP(i, n) p[i] = i; random_shuffle(p, p + n);

	int off = 0;
	for (int now = n - 1; now >= 0; --now) {
		REP(i, 1) {
			addret(1); off = (off + 1) % n;
			//printf("p:"); REP(j, n) printf(" %d", p[j]); printf(" (off=%d)\n", off);
		}
		REP(i, now) {
			int a = off, b = (off + n - 1) % n;
			if (p[a] < p[b]) { addret(n - 1); swap(p[a], p[b]); }
			addret(1); off = (off + 1) % n;
			//printf("p:"); REP(j, n) printf(" %d", p[j]); printf(" (off=%d)\n", off);
		}
		REP(i, n - now - 1) {
			addret(1); off = (off + 1) % n;
			//printf("p:"); REP(j, n) printf(" %d", p[j]); printf(" (off=%d)\n", off);
		}
	}
	//printf("p:"); REP(j, n) printf(" %d", p[j]); printf(" (off=%d,nret=%d)\n", off,nret);
	printf("%d\n", nret); REP(i, nret) printf("%d\n", ret[i]);

}

int main() {
	run();
	return 0;
}
