//Cut it out, you've already lost.
#include<bits/stdc++.h>
using namespace std;
const int maxn=500005;
int n,m,T,ans,flg,tot;
int t[maxn],a[maxn],b[maxn],c[maxn],d[maxn];
void dfs(int x){
	if(x==0){
		m=1;
		t[1]=0,c[1]=128,d[1]=1;
		tot=0;
		return ;
	}
	if(x==2){
		m=2;
		t[1]=1,a[1]=1,b[1]=2,c[1]=1,d[1]=1;
		t[2]=0,c[2]=128,d[2]=1;
		tot=1;
		return ;
	}
	if(x%4==0){
		dfs(x-2);
		tot++,t[m]=1,a[m]=tot,b[m]=m+1,c[m]=tot,d[m]=m;
		m++,t[m]=0,c[m]=128,d[m]=1;
	}
	else{
		dfs((x-2)/2);
		tot++,t[m]=1,a[m]=tot,b[m]=m+1,c[m]=tot,d[m]=1;
		m++,t[m]=0,c[m]=128,d[m]=1;
	}
}
int main(){
	scanf("%d",&n),n--;
	dfs(n);
	printf("%d\n",m);
	for(int i=1;i<=m;i++){
		if(t[i]==0)
			printf("HALT; PUSH %d GOTO %d\n",c[i],d[i]);
		else printf("POP %d GOTO %d; PUSH %d GOTO %d\n",a[i],b[i],c[i],d[i]);
	}
	return 0;
}