#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1030;
vector<string> cons(int w) {
	vector<string> prog;
	for (int i = 29; ~i; i--) if (w >> i & 1) prog.push_back("POP 60 GOTO 1; PUSH " + to_string(i + 1) + " GOTO " + to_string(prog.size() + 2));
	int cur = prog.size() + 1;
	for (int i = 1; i <= 30; i++) prog.push_back("POP " + to_string(i) + " GOTO " + to_string(prog.size() + 2) + "; PUSH " + to_string(i) + " GOTO " + to_string(cur));
	prog.push_back("HALT; PUSH 60 GOTO 1");
	return prog;
}

const int N=105;
int n;
pair<long long, int> dp[N][N];
int vis[N][N];
int zy1[N][2],zy2[N][2];
pair<long long,int> dfs(int u,int x)
{
	if(u==n+1) return make_pair(0,n+1);
	if(vis[u][x]==2) return dp[u][x];
	if(vis[u][x]==1)
	{
		puts("-1");
		exit(0);
	}
	vis[u][x]=1;
	if(zy1[u][0]==x) return vis[u][x]=2,dp[u][x]=make_pair(1,zy1[u][1]);
	pair<long long, int> p1=dfs(zy2[u][1],zy2[u][0]);
	pair<long long, int> p2=dfs(p1.second,x);
	dp[u][x]=make_pair(p2.first+p1.first+1,p2.second);
	vis[u][x]=2;
	return dp[u][x];
}

vector<int> comp(string str, int x) {
	vector<int> res; int p = 0; while (x--) {
		while (str[p] < '0' || str[p] > '9') p++;
		int x = str[p++] - '0'; while (str[p] >= '0' && str[p] <= '9') x = 10 * x + str[p] - '0', p++;
		res.push_back(x);
	}
	return res;
}

long long solve(vector<string> prg)
{
	memset(dp, 0, sizeof dp);
	memset(vis, 0, sizeof vis);
	memset(zy1, 0, sizeof zy1);
	memset(zy2, 0, sizeof zy2);
	n = prg.size();
    for(int i=1;i<=n;i++)
	{
		char ch = prg[i - 1][0];
		auto V = comp(prg[i - 1], ch == 'P' ? 4 : 2);
		// for (int x : V) printf("%d ", x); puts("");
        if(ch=='P')
		{
			zy1[i][0]=V[0];zy1[i][1]=V[1];
			zy2[i][0]=V[2],zy2[i][1]=V[3];
        }
        else
        {
			zy1[i][0]=0;zy1[i][1]=n+1;
			zy2[i][0]=V[0],zy2[i][1]=V[1];
        }
    }
	// return 0;
	pair<long long, int> ans=dfs(1,0);
	// printf("%lld\n",ans.first);
	return ans.first;
}

int Clear(int x)
{
	vector<string> prog = cons((1 << 30) - (2 * x - 1));
	// printf("prog #%d: %lld, len = %d\n", x, solve(prog), (int)prog.size());
	return solve(prog);
}

int main() {
	int f; scanf("%d", &f);
	int l = 1, r = 536870911 + 1;
	while (l + 1 < r) {
		int mid = (l + r) >> 1;
		if (Clear(mid) <= f) l = mid; else r = mid;
	}
	int ans = Clear(l); auto prg = cons((1 << 30) - (2 * l - 1));
	// printf("dif = %d\n", f - ans);
	int dif = f - ans;
	if (f < 65) prg.clear(), dif = f - 1;
	else prg.pop_back();
	// printf("dif = %d\n", dif);
	for (int k = 1; k < 9; k++) if (dif >> k & 1) {
		prg.push_back("POP 1 GOTO " + to_string(prg.size() + 2) + "; PUSH " + to_string(k) + " GOTO " + to_string(prg.size() + 2));
		int cur = prg.size() + 1;
		for (int j = 1; j <= k; j++) {
			prg.push_back("POP " + to_string(j) + " GOTO " + to_string(prg.size() + 2) + "; PUSH " + to_string(j) + " GOTO " + to_string(cur));
		}
	}
	// for (int w = 0; w < dif; w++) {
	// 	prg.push_back("POP 1 GOTO " + to_string(prg.size() + 2) + "; PUSH 1 GOTO " + to_string(prg.size() + 2));
	// }
	prg.push_back("HALT; PUSH 60 GOTO 1");
	// printf("len = %d\n", (int)prg.size());
	// printf("%lld\n", solve(prg));
	printf("%d\n", (int)prg.size());
	for (auto &s : prg) cout << s << '\n';
	// for (int i = 1073741823; i <= 1073741823; i++) Clear(i);
}