#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}


void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll K;
    cin >> K;
    K /= 2;
    K++;
    vector<int> op;
    while (K != 1){
        if (K & 1){
            K--;
            op.push_back(0);
        }
        else{
            K /= 2;
            op.push_back(1);
        }
    }
    reverse(all(op));
    vector<pair<pair<int, int>, pair<int, int>>> ans;
    ans.push_back({{-1, -1}, {-1, -1}});
    int H = 0;
    int st = 0;
    int num = 1;
    for (auto v : op){
        num++;
        if (v == 0){
            ans[H] = {{num, ans.size()}, {num, st}};
            st = H;
            H = ans.size();
            ans.push_back({{-1, -1}, {-1, -1}});
        }
        else{
            ans[H] = {{num, ans.size()}, {num, st}};
            H = ans.size();
            ans.push_back({{-1, -1}, {-1, -1}});
        }
    }
    auto f = [&](int a) -> int {
        if (a == -1) return -1;
        a = (a + ans.size() - st) % ans.size();
        return a + 1;
    };
    cout << ans.size() << "\n";
    rep(i, 0, ans.size()){
        int ind = (i + st) % ans.size();
        if (ans[ind].first.first == -1){
            cout << "HALT; PUSH 1 GOTO 1\n";
        }
        else{
            cout << "POP " << ans[ind].first.first << " ";
            cout << "GOTO " << f(ans[ind].first.second) << "; ";
            cout << "PUSH " << ans[ind].second.first << " ";
            cout << "GOTO " << f(ans[ind].second.second) << "\n";
        }
    }
}