#include <bits/stdc++.h>
using namespace std;
const int W = 64;
typedef int Rg;
typedef pair<int, int> pii;
#define fi first
#define se second
int s[600], t;
int New() { return s[t--]; }
void Del(int x) { s[++t] = x; }
void Set(Rg out, Rg in) { printf("SET %d %d\n", out, in); }
void Xor(Rg out, Rg in0, Rg in1) { printf("XOR %d %d %d\n", out, in0, in1); }
void And(Rg out, Rg in0, Rg in1) { printf("AND %d %d %d\n", out, in0, in1); }
void Or(Rg out, Rg in0, Rg in1) { printf("OR %d %d %d\n", out, in0, in1); }
void Lsh(Rg io, int k) { printf("LSH %d %d\n", io, k); }
void Rsh(Rg io, int k) { printf("RSH %d %d\n", io, k); }
void Get(Rg io, int k) { Lsh(io, W - k - 1), Rsh(io, W - 1); }
void Fill(Rg io, Rg h[3]) {
	const Rg h0 = h[0], h1 = h[1], h2 = h[2];
	Set(h0, io), Set(h1, io), Set(h2, io);
	Lsh(h0, 1), Lsh(h1, 2), Lsh(h2, 3);
	Or(io, io, h0), Or(h1, h1, h2), Or(io, io, h1);
	Set(h0, io), Set(h1, io), Set(h2, io);
	Lsh(h0, 4), Lsh(h1, 8), Lsh(h2, 12);
	Or(io, io, h0), Or(h1, h1, h2), Or(io, io, h1);
	Set(h0, io), Set(h1, io), Set(h2, io);
	Lsh(h0, 16), Lsh(h1, 32), Lsh(h2, 48);
	Or(io, io, h0), Or(h1, h1, h2), Or(io, io, h1);
}
void Add(Rg in0, Rg in1, Rg out, Rg h[128]) {
	Rg *const h0 = h, *const h1 = h + 64;
	h0[0] = out, And(h0[0], in0, in1), Xor(h1[0], in0, in1);
	for(int i = 1; i < W - 1; ++i) Set(h0[i], h0[0]), Lsh(h0[i], i + 1);
	for(int i = 1; i < W - 1; ++i) Set(h1[i], h1[0]), Lsh(h1[i], i + 1);
	Set(h0[W - 1], 3), Set(h1[W - 1], 3);
	Lsh(h0[0], 1), Xor(h0[0], h0[0], h1[0]), Lsh(h1[0], 1);
	for(int l = 1; l < W; l <<= 1)
		for(int i = 0; i < W; i += (l << 1))
			for(int j = l; j < (l << 1); ++j)
				And(h1[i + j], h1[i + l - 1], h1[i + j]);
	for(int i = 1; i < W; ++i) And(h0[i], h0[i], h1[i - 1]);
	for(int l = 1; l < W; l <<= 1)
		for(int i = 0; i < W; i += (l << 1)) Xor(h0[i], h0[i], h0[i + l]);
}
void Add3(Rg io0, Rg io1, Rg in2, Rg h[2]) {
	const Rg h0 = h[0], h1 = h[1];
	Xor(h0, io0, io1), And(h1, io0, io1);
	And(io1, in2, h0), Xor(io1, io1, h1);
	Xor(io0, in2, h0), Lsh(io1, 1);
}
int main() {
	for(int i = 400; i >= 4; --i) Del(i);
	int a[W], b[W], c[W * 3], a0, a1, a2, d;
	for(int i = 0; i < W; ++i) a[i] = New();
	for(int i = 0; i < W; ++i) b[i] = New();
	for(int i = 0; i < W * 3; ++i) c[i] = New();
	for(int i = 0; i < W; ++i) {
		Set(a[i], 1), Lsh(a[i], i);
		Set(b[i], 2), Get(b[i], i);
		Fill(b[i], c + i * 3);
		And(a[i], a[i], b[i]);
	}
	priority_queue<pii, vector<pii>, greater<pii>> Q;
	for(int i = 0; i < W; ++i) Q.emplace(0, a[i]);
	for(int i = 0; i < W - 2; ++i) {
		a0 = Q.top().se, Q.pop(), a1 = Q.top().se, Q.pop();
		a2 = Q.top().se, d = Q.top().fi, Q.pop();
		Add3(a0, a1, a2, c + i * 2);
		Q.emplace(d + 2, a0), Q.emplace(d + 4, a1);
	}
	a0 = Q.top().se, Q.pop(), a1 = Q.top().se, Add(a0, a1, 1, c);
	return 0;
}