#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int n, lacate, chei, i, j;
int main() {
    ifstream f("lacate.in");
    ofstream g("lacate.out");

    f>>n;

    //se rezolva pe foaie, solutia = n lacate, 2 chei fiecare, repartizarea cheilor = perechi de forma (i, i+1)
    //testat pana la n=4 (lenea...)

    if(n==2) {
        g<<"1 1\n1\n1\n";
        return 0;
    }

    lacate = n;
    chei = 2;

    g<<lacate<<" "<<chei<<"\n";
    for(i=1; i<n; i++) g<<i<<" "<<i+1<<"\n";
    g<<"1 "<<n<<"\n";

	return 0;
}