import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

A = int(input())

if A==0:
    print(2,0)
    exit()
if A==1:
    print(2,1)
    print(1,2)
    exit()

n = A.bit_length()-1

E = []
for i in range(1,n):
    E.append((2*i-1,2*i+1))
    E.append((2*i-1,2*i+2))
    E.append((2*i,2*i+1))
    E.append((2*i,2*i+2))

for i in range(2*n+1,3*n):
    E.append((i,i+1))

E.append((3*n+1,1))
E.append((3*n+1,2))
E.append((3*n+1,2*n+1))
E.append((2*n-1,3*n+2))
E.append((2*n,3*n+2))

for i in range(2*n+1,3*n+1):
    p = 3*n - i
    if A>>p & 1:
        if p==0:
            E.append((i,3*n+2))
        else:
            k = i-2*n
            E.append((i,2*k+1))
            E.append((i,2*k+2))

p = [i for i in range(3*n+3)]
p[1],p[3*n+1] = p[3*n+1],p[1]
print(3*n+2,len(E))
for u,v in E:
    print(p[u],p[v])