cur = [0]*100
nxt = [0]*100
cur[0] = 1
x = -1
while x < 40:
    for i in range(100):
        nxt[i] = cur[i]
        if i > 0:
            nxt[i] += cur[i-1]
        if i < 99:
            nxt[i] += cur[i+1]
    cur = nxt
    x+=1
    nxt = [0]*100
cur = sorted(cur)[::-1]
# miejsce = 0
# for aa in cur:
#     print(miejsce,aa)
#     miejsce+=1
maks = 0
ile = 0
print(1000)
for i in range(0,2000,2):
    print(0,i,1)
    for j in range(1,100):
        print(j,i,0)
co = int(input())
i = 0
tab = []
while co != 0:
    if cur[i] <= co:
        pom = co//cur[i]
        ile+=pom
        co -= cur[i]*pom
        a=0
        while pom > 0:
            pom-=1
            tab.append([i,a])
            a+=2
    else:
        i+=1
print(ile,41)
for a,b in tab:
    print(a,b)