#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXN = 67;
vector<pii> vec[MAXN];
int p2[2 * MAXN];
void display(int x, int y){
cout << "CMPSWP R" << x << " R" << y << " ";
}
int Sort(int l, int p, int f, int L){
if(p <= l){
return 0;
}
int x = p2[p - l + 1];
for(int i = l; i <= p - x; i++){
pii add = mp(i, i + x);
if(f){
swap(add.fi, add.se);
}
vec[L].pb(add);
}
return 1 + max(Sort(l, l + x - 1, f, L + 1), Sort(l + x, p, f, L + 1));
}
int solve(int l, int p, int f, int L){
if(p <= l){
return 0;
}
int mid = (l + p) / 2;
int add = max(solve(l, mid, 1 - f, L), solve(mid + 1, p, f, L));
add += Sort(l, p, f, L + add);
//cerr << l << ' ' << p << ' ' << f << ' ' << add << '\n';
return add;
}
int main(){
// ios_base::sync_with_stdio(0);
// cin.tie(NULL);
// cout.tie(NULL);
int n;
cin >> n;
for(int i = 1; i < 2 * MAXN; i++){
int xd = 1;
while(xd * 2 < i){
xd *= 2;
}
p2[i] = xd;
}
int k = solve(1, n, 0, 1);
cout << k << endl;
cout.flush();
for(int i = 1; i <= k; i++){
for(auto ele : vec[i]){
display(ele.fi, ele.se);
}
cout << endl;
cout.flush();
}
return 0;
}
