#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
void f(int n , char A , char B , char C)
{
	if(n == 0)
		return ;
	f( n-1 , A , C , B);
	cout << "Move " << A <<" to "<<C<<endl;
	f(n-1 , B , A,C);

}
int main()
{
	int n ;
	cin >> n;
	cout << pow(2,n) - 1 << endl;
	f(n,'A' , 'B'  , 'C');
	return 0;
}