#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(3); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int AND=0,OR=1;
int n,ps[111],tot;
int val[111111];

void add(int x,int O,VI y) {
	printf(O==AND?"AND":"OR");
	printf(" %d",SZ(y));
	for (auto z:y) printf(" %d",z); puts("");
	for (auto z:y) assert(z<x);

	if (O==AND) {
		int s=1;
		for (auto z:y) if (z==-2) s=0; else if (z==-1) s=s;
			else s&=val[z];
		val[x]=s;
	} else {
		int s=0;
		for (auto z:y) if (z==-2) s=s; else if (z==-1) s=1;
			else s|=val[z];
		val[x]=s;
	}
}
vector<int> build(int l,int r) {
	if (l==r) {
		return VI{ps[l]};
	} else {
		int md=(l+r)>>1;
		auto L=build(l,md);
		auto R=build(md+1,r);
		int sz=r-l+1;
		VI z;
		rep(i,1,sz+1) {
			VI cand;
			rep(vl,0,i+1) {
				int vr=i-vl;
				if (vl>sz/2||vr>sz/2) continue;
				if (vl>0&&vr>0) {
					++tot;
					add(tot,AND,VI{L[vl-1],R[vr-1]});
					cand.pb(tot);
				} else {
					if (vl==0) cand.pb(R[vr-1]);
					else cand.pb(L[vl-1]);
				}
			}
			++tot;
			add(tot,OR,cand);
			z.pb(tot);
		}
		return z;
	}
}
const int N=64;
int main() {
	scanf("%d",&n);
	//rep(i,1,n+1) scanf("%d",&val[i]);
	rep(i,1,n+1) ps[i]=i;
	rep(i,1,n+1) val[i]=rnd(2);
	//rep(i,1,n+1) printf("%d ",val[i]); puts("");
	int pc=(n+1)/2;
	rep(i,n+1,N+1) {
		if (pc<N/2) ps[i]=-1;
		else ps[i]=-2;
		++pc;
	}
	printf("2401\n");
	tot=n;
	auto o=build(1,N);
	++tot;
	add(tot,OR,VI{o[N/2-1]});
	//for (auto p:o) printf("%d ",val[p]); puts("");
	//printf("%d\n",tot-n);
}