1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
 
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
 
#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXS 130 

int k;
VI graf[MAXS];
int paths[MAXS];

int main(){
    
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>k;

    graf[1].PB(2);
    graf[1].PB(3);
    paths[2]=0; //2^0
    paths[3]=0; //2^0

    int wyn=0;
    for(int p1=4;p1<=120;p1+=2){

        if(k&(1<<paths[p1-2])){
            graf[p1-2].PB(INF);
            graf[p1-2].PB(p1-1);
            graf[p1-1].PB(p1);
            graf[p1-1].PB(p1+1);
            paths[p1]=paths[p1+1]=paths[p1-1]+1;
            k-=(1<<paths[p1-2]);
        }
        else{
            graf[p1-2].PB(p1);
            graf[p1-2].PB(p1+1);
            graf[p1-1].PB(p1);
            graf[p1-1].PB(p1+1);
            paths[p1]=paths[p1+1]=paths[p1-1]+1;
        }
        if(k==0){
            wyn=p1+2;
            break;
        }
    }

    cout<<wyn<<"\n";
    FOR(i,1,wyn){
        while(SIZE(graf[i])<2)
            graf[i].PB(-1);
        for(auto x:graf[i]){
            if(x==INF)
                cout<<wyn<<" ";
            else 
                cout<<x<<" ";
        }
        cout<<"\n";
    }

}