#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

// https://atcoder.jp/contests/pakencamp-2018-day2/tasks/pakencamp_2018_day2_f
int main() {
  constexpr int B = 4, L = 20, N = L * B + 1 + L;
  ll a; cin >> a;
  vector<pair<int, int>> ans;
  REP(i, B) ans.emplace_back(0, i + 1);
  REP(i, L - 1) REP(j, B) REP(k, B) ans.emplace_back(i * B + 1 + j, (i + 1) * B + 1 + k);
  FOR(i, 1, L) {
    const int id = L * 4 + i;
    ans.emplace_back(id, id + 1);
  }
  for (int i = 1, j = L * 4 + 1; a > 0; a /= B, i += B, ++j) {
    REP(k, a % B) ans.emplace_back(i + k, j);
  }
  cout << N << " " << ans.size() << '\n';
  for (const auto [u, v] : ans) cout << u + 1 << " " << v + 1 << '\n';
  return 0;
}