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
#include <bits/stdc++.h>
using namespace std;
#define mk make_pair
#define fi first
#define sz(x) x.size()
#define se second
#define pb push_back
#define VAR(v) #v << " = " << v << " "
#define debug if(0)
#define M_PI 3.14159265358979323846
typedef complex<long double> C;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ll> Matrix;
const int maxn = (int)1e6 + 9;
const int INF = (int)1e9 + 7;
int mod = (int)1e9 + 7;
int k;
vector<int> G[101];

void add_edge(int u, int v){
    G[u].pb(v);
    debug cout << u << " -> " << v << endl;
}

int main(int argc, char* argv[])
{
    ios::sync_with_stdio(false);
    debug; else cin.tie(NULL), cout.tie(NULL);
    cin>>k;
    int two = 1;
    while((1<<two) <= k)
    {
        add_edge(2*two - 1, 2*two);
        add_edge(2*two, 2*two + 1);
        add_edge(2*two-1, 2*two+1);
        two++;
    }
    int n = 2*two;
    add_edge(2*two - 1, n);
    for(int i = 0 ; (1<<i) <= k / 2; i++)
        if(k & (1<<i))
            add_edge(2*i + 2, n);
    debug cout << two<<endl;
    cout<<n<<"\n";
    for(int i = 1; i <= n; i++){
        int j = 0;
        for(; j < G[i].size(); j++)
            cout<<G[i][j]<<" ";
        for(; j < 2; j++)
            cout<<-1<<" ";
        cout<<"\n";
    }
    return 0;
}