#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=444;
int t[M],a[M],k,L[M],R[M];
void con(int le,int V,int E){
	cout<<V<<" "<<E<<"\n";
	int la=-1,o=0;
	F(i,1,le){
		if (a[i]==1){
			L[i]=++o;
			if(la!=-1) cout<<la<<" "<<L[i]<<"\n";
			R[i]=o+a[i]-1;
			la=o;
			continue;
		}
		L[i]=++o;
		R[i]=o+a[i]-1;
		if (la!=-1) cout<<la<<" "<<L[i]<<"\n"; 
		F(j,L[i],R[i]){
			F(k,j+1,R[i]){
				cout<<j<<" "<<k<<"\n";
			}
		}
		o=R[i];
		la=++o;
		cout<<R[i]<<" "<<la<<"\n";
	}
	cout<<o<<" "<<1<<"\n";
}
void solve(){
//	F(num,2,20){
		int V=0,E=0;
		int x=k;
		int h=20,ct=0;
		while (x>=6){
			while (x<h*(h+3)/2-3+(ct==0) && h>=4) h--;
			x-=h*(h+3)/2-3; E+=h*(h-1)/2+2;
			a[++ct]=h;
			V+=h+1;
		}
//		if (ct>num) continue;
		F(i,1,x){
			a[++ct]=1;
			V++; E++;
		}
		if (V<=20){
//			assert(ct>1);
			con(ct,V,E);
//			puts("OK");
			return ;
		}
//	}
//	cerr<<k<<"\n";
	puts("NO");
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);

	k=read();
	if (k==1){
		cout<<"2 1\n1 2\n";
		return 0;
	}
	if (k==2){
		cout<<"4 4\n1 2\n1 3\n2 3\n3 4\n";
		return 0;
	}
	if (k==3){
		cout<<"3 3\n1 2\n2 3\n3 1\n";
		return 0;
	}
	if (k<=20){
		cout<<k<<" "<<k<<'\n';
		cout<<1<<" "<<k<<"\n";
		F(i,1,k-1) cout<<i<<" "<<i+1<<"\n";
		return 0;
	}
	solve();
//	F(o,21,60){
//		k=o;
//		solve();
//	}
	
	
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/