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
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <bitset>
using namespace std;

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#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 VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_N = 105;
const int MAX_POW = 31;

int k;
int vCount = 1;
vector<int> g[MAX_N];
int pow2Vertices[MAX_N];

void generateGraph()
{
    for(int i = 0; i < MAX_POW; ++i)
    {
        const int startV = 3*i + 1;

        g[startV].push_back(startV+1);
        g[startV].push_back(startV+2);
        g[startV+1].push_back(startV+3);
        g[startV+2].push_back(startV+3);

        pow2Vertices[i] = startV+2;

        vCount += 3;
    }

    ++vCount;
    for(int i = 0; i < MAX_POW; ++i)
    {
        if((k&1) == 1)
        {
            g[pow2Vertices[i]].push_back(vCount);
        }

        k >>= 1;
    }
}

int main()
{
    ios_base::sync_with_stdio(0);

    cin >> k;

    generateGraph();

    cout << vCount << endl;
    for(int i = 1; i <= vCount; ++i)
    {
        //cout << "i: " << i << ", vs: ";
        for(const int v : g[i])
        {
            cout << v << ' ';
        }
        for(int j = g[i].size(); j < 2; ++j)
        {
            cout << -1 << ' ';
        }
        cout << endl;
    }

    return 0;
}