#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

void solve(){
	int n;
	cin>>n;
	vector<lld> A(n);
	vector<lld> B(n);
	rep(i,0,n)cin>>A[i];
	rep(i,0,n)cin>>B[i];
	vector<tuple<int,int,int> >op;
	op.push_back({0,n-1,0});
	vector<lld> C;
	sort(A.begin(),A.end());
	rep(i,0,n-1){
		int idx=-1;
		rep(j,i,n){
			if(A[j]==B[i]){
				idx=j;
			}
		}
		//rep(j,0,n)cout<<A[j]<<" ";
		//cout<<endl;
		//cout<<idx<<endl;
		C.clear();
		rep(j,0,n)C.push_back(A[j]);
		sort(C.begin()+i,C.begin()+idx+1);
		
		if(C[i]==B[i]){
			sort(A.begin()+i,A.begin()+idx+1);
			op.push_back({i,idx,0});
		}else{
			sort(A.begin()+i,A.begin()+idx+1);
			reverse(A.begin()+i,A.begin()+idx+1);
			//rep(j,0,n)cout<<A[j]<<" ";
			//cout<<endl;
			assert(A[i]==B[i]);
			op.push_back({i,idx,1});
		}
	}
	assert((int)op.size()<=n);
	cout<<op.size()<<"\n";
	trav(a,op){
		cout<<get<0>(a)+1<<" "<<get<1>(a)+1<<" ";
		if(get<2>(a)==0)cout<<"I\n";
		else cout<<"D\n";
	}
}

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