#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;

int K, num[40], cnt, N;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct ord
{
    int tpe, a, x, b, y;
    void print()
    {
        if(tpe==1) cout << "POP " << a << " GOTO " << x << "; PUSH " << b << " GOTO " << y << '\n';
        else cout << "HALT; PUSH " << b << " GOTO " << y << '\n';
    }
}ar[80];
int main()
{
    // freopen("testdata.in","r",stdin);
    K=read();
    if(K==1) {cout << "1\nHALT; PUSH 1 GOTO 1\n"; return (0-0);}
    int dig=0;
    while(K)
    {
        dig++;
        if(K%2==1) num[++cnt]=dig;
        K/=2;
    }
    for(int i=1;i<=dig-1;i++)   
        ar[i]={1,i,i-1,i,dig-1};
    int tot=dig-1;
    for(int i=cnt,now=dig-1;i>1;i--)
    {
        if(i==cnt) ar[1].x=tot+1, ar[++tot]={2,0,0,1,1};
        else
        {
            int pow=num[i]-1;
            // cout << "pow=" << pow << '\n';
            ar[pow+1].x=tot+1;
            ar[tot+1]={1,tot+1,pow,tot+1,tot+1};
            tot++;
        }
    }
    cout << tot << '\n';
    for(int i=1;i<=tot;i++)
        ar[i].print();
    return (0-0);
}