#include<bits/stdc++.h>

using namespace std;
#define int long long
const int N = 1e6 + 10, inf = 1e15;

// POP a GOTO x; PUSH b GOTO y
string get1(int a, int x, int b, int y){
    return "POP " + to_string(a) + " GOTO " + to_string(x) + "; " + "PUSH " + to_string(b) + " GOTO " + to_string(y);
}

// HALT; PUSH b GOTO y
string get2(int b, int y){
    return string("HALT; ") + string("PUSH ") + to_string(b) + string(" GOTO ") + to_string(y);
}

int t = 1, bg = 1;
vector<string>ans;

void solve() {
    int n;
    cin >> n;
    int k = n - 1;

    int cnt = 0;
    vector<int>vt;
    while(k){
        if(k > 2 && (k - 2) % 2 == 0 && (k - 2) / 2 % 2 == 0){
            k = (k - 2) / 2;
            vt.push_back(1);
            cnt ++;
        }
        else{
            cnt ++;
            k -= 2;
            vt.push_back(2);
        }
    }

    for(int i = (int)vt.size() - 1; i >= 0; i --){
        if(vt[i] == 1){
            k = k * 2 + 2;
            ans.push_back(get1(t, t + 1, t, bg));
        }
        else{
            k += 2;
            ans.push_back(get1(t, t + 1, t, t));
        }
        t ++;
    }
    
    ans.push_back(get2(t, t));
    cout << ans.size() << endl;
    for(auto x : ans) cout << x << endl;
}

signed main() {
    // std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}