#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

void testcase(){
    i64 N; cin >> N;
    auto rec = [&](auto& rec, i64 N) -> pair<i64, vector<vector<i64>>> {
        if(N == 0){
            vector<vector<i64>> ans;
            ans.push_back({ -1, -1, 0, 0 });
            return { 0, ans };
        } if(N == 2){
            vector<vector<i64>> ans;
            ans.push_back({ 0, 1, 0, 0 });
            ans.push_back({ -1, -1, 0, 1 });
            return { 1, ans };
        } if(N == 6){
            vector<vector<i64>> ans;
            ans.push_back({ 0, 1, 0, 0 });
            ans.push_back({ 1, 2, 1, 0 });
            ans.push_back({ -1, -1, 0, 2 });
            return { 2, ans };
        } if(N == 4){
            vector<vector<i64>> ans;
            ans.push_back({ 0, 1, 0, 0 });
            ans.push_back({ 1, 2, 1, 1 });
            ans.push_back({ -1, -1, 0, 2 });
            return { 2, ans };
        }
        auto [z, f] = rec(rec, (N - 2) / 4 * 2);
        if(N % 4 == 0){
            for(auto& e : f){
                if(e[0] != -1) e[0] += 2;
                if(e[1] == z) e[1] = 1; else if(e[1] != -1) e[1] += 2;
                if(e[2] != -1) e[2] += 2;
                if(e[3] == z) e[3] = 1; if(e[3] != -1) e[3] += 2;
            }
            z += 2;
            f.insert(f.begin(), { 1, 0, 1, 2 });
            f.insert(f.begin(), { 0, z, 0, 2 });
        } else {
            for(auto& e : f){
                if(e[0] != -1) e[0] += 1;
                if(e[1] == z) e[1] = i64(f.size());
                if(e[2] != -1) e[2] += 1;
                if(e[3] == z) e[3] = i64(f.size());
            }
            f.insert(f.end(), { 0, z, 0, 0 });
        }
        return { z, f };
    };
    auto [z,ans] = rec(rec, N-1);
    //cout << "z = " << z << endl;
    cout << ans.size() << "\n";
    for(auto a : ans){
        if(a[0] == -1){
            cout << "HALT; ";
        } else {
            cout << "POP " << (a[0] + 1) << " GOTO " << (a[1] + 1) << "; ";
        }
        cout << "PUSH " << (a[2] + 1) << " GOTO " << (a[3] + 1) << "\n";
    }
    //vector<int> X;
    //int p = 0;
    //int cnt = 0;
    //while(true){
    //    cnt++;
    //    auto inst = ans[p];
    //    if(inst[0] == -1){
    //        if(X.empty()) break;
    //    } else {
    //        if(!X.empty() && X.back() == inst[0]){
    //            X.pop_back();
    //            p = inst[1];
    //            continue;
    //        }
    //    }
    //    X.push_back(inst[2]);
    //    p = inst[3];
    //}
    //cout << "cnt = " << cnt << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}