#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int K;cin>>K;
    int N=1024;
    vi A(N/2),B(N/2);
    for(int i=0;i<N/2;i++){
        A[i]=2*i;
        B[i]=2*i+1;
    }
    vii E;
    for(int i=0;i<si(A);i++){
        for(int j=0;j<si(B);j++){
            if(i!=j) E.pb(mp(A[i],B[j]));
        }
    }
    cout<<N<<" "<<si(E)<<" "<<2<<"\n";
    for(int i=0;i<N;i++){
        cout<<i%2+1<<" ";
    }
    cout<<"\n";
    for(auto [a,b]:E) cout<<a+1<<" "<<b+1<<"\n";
}