#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;
}

n = int(input())
print(2**n - 1)
def move(n, a, b, c):
    if n ==1:
        print("Move",a,"to",c)
        return
    move(n-1, a, c, b)
    print("Move",a,"to",c)
    move(n-1, b, a, c)
move(n, 'A', 'B', 'C')

/*****************************************
备注：
******************************************/
#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;
}

#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include<cstring>
#include <algorithm>
#define LL long long
const int N = 1e2 + 10;
const int INF = 0x3f3f3f3f;
using namespace std;
int n ;
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()
{
	cin >> n ;
	cout << pow(2,n) - 1 << endl ;
	f( n , 'A' , 'B' , 'C' ); 
	return 0;
}

#include<algorithm>
#include<cmath>
using namespace std;
void h(int n,char a, char b, char c){
	if (n==1){
		cout << "Move"<<" " << a << " " <<"to" <<" " <<c << endl;
	}
	else {
		h(n-1,a,c,b);
		h(1,a,b,c );
		h(n-1,b,a,c);
	}
	
}

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

#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;
}

#include<iostream> #include<algorithm> #include<cmath> using namespace std; void h(int n,char a, char b, char c){ if (n==1){ cout << "Move"<<" " << a << " " <<"to" <<" " <<c << endl; } else { h(n-1,a,c,b); h(1,a,b,c ); h(n-1,b,a,c); }

}

int main(){ int n; cin >> n; cout << pow(2 , n)-1 << endl; h(n,'A','B','C'); return 0; }//非常简单

#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; }