/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int n;
void construct(int cnt,int del)
{
//	if(cnt==7)
//	{
//		
//		cout<<del+1<<" "<<del+2<<"\n";
//		cout<<del+2<<" "<<del+3<<"\n";
//		cout<<del+3<<" "<<del+1<<"\n";
//		cout<<del+1<<" "<<del+4<<"\n";
//		cout<<del+4<<" "<<del+5<<"\n";
//		cout<<del+2<<" "<<del+6<<"\n";
//		return; 
//	}
	cout<<del+1<<" "<<del+2<<"\n";
	cout<<del+1<<" "<<del+3<<"\n";
	cout<<del+1<<" "<<del+4<<"\n";
	cout<<del+3<<" "<<del+5<<"\n";
	cout<<del+2<<" "<<del+6<<"\n";
	for(int i=7;i<=cnt;i++) cout<<i-1+del<<" "<<i+del<<"\n";
}
void solve()
{
	cin>>n;
	if(n==1)
	{
		cout<<"YES\n0\n";
		return;
	}
	if(n<=5)
	{
		cout<<"NO\n";
		return;
	}
	if(n==6||n==7)
	{
		cout<<"YES\n6\n";
		cout<<"1 2\n2 3\n3 1\n1 4\n4 5\n2 6\n";
		return;
	}
	vector <int> vec;
	for(int x=7,y=n-1;1;)
	{
		if(x<=y)
		{
			vec.pb(x);
			y-=x,x++;
		}
		else
		{
			vec.back()+=y;
			break;
		}
	}
	int tot=0;
	for(int i=0;i<vec.size();i++) tot+=vec[i]-1;
	cout<<"YES\n"<<tot<<"\n";
	for(int i=0,del=0;i<vec.size();i++) construct(vec[i],del),del+=vec[i];
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}