"""input"""
#int-input
# input = sys.stdin.readline
def II(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(MI())
#str-input
def SI(): return input()
def MSI(): return input().split()
def SI_L(): return list(SI())
def SI_LI(): return list(map(int, SI()))
#multiple-input
def LLI(n): return [LI() for _ in range(n)]
def LSI(n): return [SI() for _ in range(n)]
#1-indexを0-indexでinput
def MI_1(): return map(lambda x:int(x)-1, input().split())
def TI_1(): return tuple(MI_1())
def LI_1(): return list(MI_1())

from collections import deque,defaultdict,Counter
mod = 998244353

class fenwick_tree():
    n=1
    data=[0 for i in range(n)]
    def __init__(self,N):
        self.n=N
        self.data=[0 for i in range(N)]
    def add(self,p,x):
        assert 0<=p<self.n,"0<=p<n,p={0},n={1}".format(p,self.n)
        p+=1
        while(p<=self.n):
            self.data[p-1]+=x
            p+=p& -p
    def sum(self,l,r):
        assert (0<=l and l<=r and r<=self.n),"0<=l<=r<=n,l={0},r={1},n={2}".format(l,r,self.n)
        return self.sum0(r)-self.sum0(l)
    def sum0(self,r):
        s=0
        while(r>0):
            s+=self.data[r-1]
            r-=r&-r
        return s

#必ず入っている集合を見つける
#必ず以下マン、以上マンを見つける
#　上72回まで
# その後は8回

m = II()
q = LI()

m -= 2
print(1+49+1+m.bit_count()+48)


p = [*range(1,51)]
print(2,*p)

#総和をこれにする
#奇数で200以上になっているはず
#mを作ったほうが早くね

# float power(int a, int b) {
#     if (b == 0) return 1;
#     if (b&1) return power(a, b-1)*a;
#     float r = power(a, b/2); 
#     return r*r;
# }
for i in range(1,50):
    print(4,i,i,i+1) #2に2を保存

print(4,1,1,50)
for i in range(49):
    if (m >> i)&1:
        print(4,50,i+1,50)

for i in range(2,50):
    print(4,50,50,i)