#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n;
int a[N];
int b[N];
bool cmp(int x, int y)
{
	return x > y;
}
int main()
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &b[i]);
	}
	printf("%d\n", n);
	sort(a + 1, a + n + 1);
	printf("%d %d I\n", 1, n);
	for(int i = n; i >= 2; i--)
	{
		int pos = 0, maxn = -1, minn = 0x3f3f3f3f;
		for(int j = i; j >= 1; j--)
		{
			maxn = max(maxn, a[j]);
			minn = min(minn, a[j]);
			if(b[i] == a[j])
			{
				pos = j;
				break;
			}

		}
		if(maxn == b[i])
		{
			printf("%d %d I\n", pos, i); 
			sort(a + pos, a + i + 1);
		}
		else
		{
	//		cout << i << " " << b[i] << " " << pos <<" "<<maxn << " ";
			printf("%d %d D\n", pos, i); 
			sort(a + pos, a + i + 1, cmp);
		}
	}
	return 0;
}