#include<bits/stdc++.h>
#define int long long
const int N=2005;
using namespace std;

int n;
int a[N],b[N];
int ia[N];
int calc(){
    int res = 0;
    for(int i=1;i<n;i++)if(a[i]!=a[i+1]-1)res++;
    return res;
}
vector<vector<int>> res;
void swap(int i,int j,int k,int l){
    int cnt = 0;
    for(int o=1;o<i;o++)b[++cnt]=a[o];
    for(int o=k;o<=l;o++)b[++cnt]=a[o];
    for(int o=j+1;o<=k-1;o++)b[++cnt]=a[o];
    for(int o=i;o<=j;o++)b[++cnt]=a[o];
    for(int o=l+1;o<=n;o++)b[++cnt]=a[o];
    assert(cnt==n);
    for(int i=1;i<=n;i++)a[i]=b[i];
    for(int i=1;i<=n;i++)ia[a[i]]=i;
    res.push_back({i,j,k,l});
}

void solve(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)ia[a[i]]=i;ia[n+1]=n+1; 
    int ans = 0;
    while(calc()){
        int m = 0;
        int I=-1, J=-1, K=-1, L=-1;
        priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q1, q2;
        q1.push({100000,-1});
        q2.push({100000,-1}); 
        for(int i=1;i<=n;i++){
            if(a[i]!=a[i-1]+1){//asi
                int x = n+1, y = n+1;
                if( a[i]!=1 )
                    x = ia[a[i]-1]+1;
                if( i != 1 && a[i-1] != n )
                    y = ia[a[i-1]+1];
                if( x == y )	
                    q2.push( {x, i} );
                else {
                    q1.push( {x, i} ); 
                    q1.push( {y, i} ); 
                }
            }
            if(a[i]!=a[i+1]-1){//asj
                while(q1.top().first < i+2)q1.pop();
                while(q2.top().first < i+2)q2.pop();
                int x = -1, y = -1;
                if( a[i]!=n )
                    x = ia[a[i]+1]-1;
                if( i != n && a[i+1] != 1 ) 
                    y = ia[a[i+1]-1];
                if( x == y ){
                    if( x == -1 )continue;
                    if( q2.top().first <= x ) {
                        if( m < 4 ){
                            m = 4;
                            I = q2.top().second;
                            J = i;
                            K = q2.top().first;
                            L = x;
                        }
                    }
                    if( q1.top().first <= x ) {
                        if( m < 3 ){
                            m = 3;
                            I = q1.top().second;
                            J = i;
                            K = q1.top().first;
                            L = x;
                        }
                    }
                }else{
                    if( q2.top().first <= x ) {
                        if( m < 3 ){
                            m = 3;
                            I = q2.top().second;
                            J = i;
                            K = q2.top().first;
                            L = x;
                        }
                    }
                    if( q2.top().first <= y ) {
                        if( m < 3 ){
                            m = 3;
                            I = q2.top().second;
                            J = i;
                            K = q2.top().first;
                            L = y;
                        }
                    }
                    if( q1.top().first <= x ) {
                        if( m < 2 ){
                            m = 2;
                            I = q1.top().second;
                            J = i;
                            K = q1.top().first;
                            L = x;
                        }
                    }
                    if( q1.top().first <= y ) {
                        if( m < 2 ){
                            m = 2;
                            I = q1.top().second;
                            J = i;
                            K = q1.top().first;
                            L = y;
                        }
                    }
                }
            }
        }
        for(int i=1;i<n;i++){
            int x=a[i],y=a[i+1];
            int l=ia[y-1]+1,r=ia[x+1]-1;
            if(l<=i&&i+1<=r){
                int res = 0;
                if(l!=1)res++;
                if(r!=n)res++;
                if(a[r]+1==a[l])res++;
                if( m < res ){
                    m = res;
                    I = l;
                    J = i;
                    K = i+1;
                    L = r;
                }
            }
        }
        swap(I,J,K,L);
        ans++;
    }
    cout << ans << endl;
    for(auto x:res){
        for(auto y:x)
            cout << y << ' ';
        cout << endl;
    }
}

main(){
    ios::sync_with_stdio(0);
    int _T=1;//cin>>_T;
    while(_T--)solve();
}