#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")



int main() {
  Int K;
  for (; ~scanf("%lld", &K); ) {
    vector<int> ops;
    for (Int g = K - 1; g; ) {
      if (g % 4 == 0) {
        ops.push_back(0);
        g -= 2;
      } else {
        ops.push_back(1);
        g -= 2;
        g /= 2;
      }
    }
    reverse(ops.begin(), ops.end());
    
    printf("%d\n", (int)ops.size() + 1);
    int n = 1;
    for (const int op : ops) {
      printf("POP %d GOTO %d; PUSH %d GOTO %d\n", n, n + 1, n, op ? 1 : n);
      ++n;
    }
    printf("HALT; PUSH %d GOTO %d\n", n, n);
  }
  return 0;
}