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
#include <bits/stdc++.h>

using namespace std;
int n;
int ile=1,ile2=1;
int x;
int maksio;
int fib[100]={0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393,196418,317811,514229,832040,1346269,2178309,3524578,5702887,9227465,14930352,24157817,39088169,63245986,102334155,165580141,267914296,433494437,701408733,1134903170};
bool t[100];
int syn[1000];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    while(n>0){
        if(n<fib[x+1]){
            n-=fib[x];
            maksio=max(maksio,x);
            t[x]=true;
            x=0;
            ile++;
        }
        else x++;
    }
    ile+=maksio;
    cout << ile << '\n';
    for(int i=1; i<ile; i++){
        if(i<maksio){
            cout << i+1 << ' ';
        }
        if(i==maksio){
            cout << -1 << ' ';
        }
        if(i>maksio){
            cout << ile << ' ';
        }
        if(t[i]){
            cout << maksio+ile2 << '\n';
            syn[maksio+ile2]=i;
            ile2++;
        }
        else if(i<maksio-1){
            cout << i+2 << '\n';
        }
        else if(i<=maksio){
            cout << -1 << '\n';
        }
        else if(i>maksio){
            if(syn[i]<maksio-1){
                cout << syn[i]+2 << '\n';
            }
            else cout << -1 << '\n';
        }
    }
    cout << -1 << ' ' << -1 << '\n';
    return 0;
}