#include <bits/stdc++.h>

using namespace std;
int v[100];
int fib[45];
int tab[100];
int k,i,j,l,si;
int main()
{
    i=1;
    fib[0]=1;
    fib[1]=1;
    cin>>k;
    do
    {
        ++i;
        fib[i]=fib[i-1]+fib[i-2];
    }while(fib[i]<k);

    if(fib[i]==k)
    {
        cout<<i+1<<endl;
        for(int b=0; b<i-1; b++)
        {
            cout<<b+2<<' '<<b+3<<endl;
        }
        cout<<i+1<<' '<<-1<<endl;
        cout<<-1<<' '<<-1;
        return 0;
    }
    i--;
    si=i+1;
    tab[j]=i;
    k-=fib[i];
    while(k>0)
    {
        i--;
        if(k>=fib[i])
        {
            k-=fib[i];
            tab[j]=i;
            j++;
        }
    }
    sort(tab,tab+j-1);
    l+=j+1;
    l+=si;
    int z=1;
    cout<<l<<endl;
    for(int b=0;b<si-2; b++)
    {
        if(tab[j-1]==b)
        {
            cout<<b+2<<' '<<si+z<<endl;
            v[z-1]=b+3;
            z++;
        }
        else
        cout<<b+2<<' '<<b+3<<endl;
    }
    cout<<si<<' '<<-1<<endl;;
    cout<<l<<' '<<-1<<endl;
    for(int o=0;o<100;o++)
    {
        if(v[o]==0) break;
        cout<<v[o]<<' '<<l<<endl;
    }
    cout<<-1<<' '<<-1;
    return 0;
}