#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
#define i128 __int128
using namespace std;

int n, kd, d;
int tot;
int sb = 0;
vector<string>vc;
int OR(vi S) {
	++sb;
	for(const int &u : S) assert(u > 0);
	string pt = "OR ";
	pt += to_string(sz(S)), pt += ' ';
	for(const int &u : S) pt += to_string(u), pt += ' ';
	vc.pb(pt);
	return ++tot;
}
int AND(vi S) {
	++sb;
	for(const int &u : S) assert(u > 0); 
	string pt = "AND ";
	pt += to_string(sz(S)), pt += ' ';
	for(const int &u : S) pt += to_string(u), pt += ' ';
	vc.pb(pt);
	return ++tot;
}

vi slv(int l, int r) {
	vi ns(r - l + 2);
	if(l == r) return ns[1] = l, ns;
	int mid = (l + r) >> 1;
	vi a = slv(l, mid), b = slv(mid + 1, r);
	int la = sz(a) - 1, lb = sz(b) - 1;
	L(i, 1, min(r - l + 1, kd)) {
		vi tmp;
		L(x, 0, la) {
			int y = i - x;
			if(0 <= y && y <= lb) {
				int o;
				if(!x) o = b[y];
				else if(!y) o = a[x];
				else o = OR(vi{a[x], b[y]});
				tmp.emplace_back(o);
			}
		}
		ns[i] = AND(tmp);
	}
	return ns;
}

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n, kd = n / 2 + 1, tot = n;
	vi o = slv(1, n);
	OR(vi{o[kd]});
	cout << sz(vc) << '\n';
	for(auto&u : vc) cout << u << '\n';
	return 0;
}