#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 4040;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

vector<vi> f[30], g[30], tmp[33], v[33];
void solve(){
	f[1].push_back((vi){});
	for(int m = 1; m <= 11; ++m){
		//cout << m << endl;
		//rep(i, 21) cout << (int)f[i].size() << " ";
		//cout << "\n";
		rep(i, 21) g[i].clear();
		function<void(vi, int)> dfs = [&](vi cur, int id){
			int len = (int)cur.size();
			if(len + m > 11 || id >= (int)f[m].size())
				return g[len + 1].push_back(cur), void();
			dfs(cur, id + 1);
			if(len + m <= 11){
				cur.push_back(0);
				for(auto x : f[m][id])
					cur.push_back(len + 1 + x);
				dfs(cur, id + 1);
			}
		};
		for(int i = 11; i >= 0; --i){
			for(auto x : f[i])
				dfs(x, 0);
		}
		rep(i, 21) g[i].swap(f[i]);
	}
	
	//cerr << 1. * clock() / CLOCKS_PER_SEC << "\n";

	v[1].push_back((vi){});
	for(int n = 2; n <= 21; ++n){
		rep(i, n+1) tmp[i].clear();
		tmp[1].push_back((vi){});
		for(int m = 1; m < (n+1) / 2; ++m){
			function<void(vi, int)> dfs = [&](vi cur, int id){
				int len = (int)cur.size();
				if(id >= (int)f[m].size())
					return g[len + 1].push_back(cur), void();
				dfs(cur, id + 1);
				if(len + m <= n){
					cur.push_back(0);
					for(auto x : f[m][id])
						cur.push_back(len + 1 + x);
					dfs(cur, id + 1);
				}
			};
			rep(i, n+1) g[i].clear();
			for(int i = n; i >= 0; --i){
				for(auto x : tmp[i])
					dfs(x, 0);
			}
			rep(i, n+1) g[i].swap(tmp[i]);
		}
		v[n] = tmp[n];
		if(n % 2 == 0){
			rep(i, (int)f[n/2].size()) rep(j, i){
				vi y = f[n/2][i], &x = f[n/2][j];
				y.push_back(0);
				rep(k, (int)x.size())
					y.push_back(x[k] + n/2);
				v[n].push_back(y);
			}
		}
		//cout << n << ": " << (int)v[n].size() << endl;
		//if(n <= 10){
		//	for(auto x : v[n]){
		//		rep(i, n-1)
		//			cout << x[i] << " ";
		//		cout << "\n";
		//	}
		//}
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	solve();

	//cerr << 1. * clock() / CLOCKS_PER_SEC << "\n";

	int n;
	cin >> n;

	if(n == 1){
		cout << "YES\n0\n";
	} else if(n <= 5){
		cout << "NO\n";
	} else if(n <= 6){
		cout << "YES\n6\n1 2\n2 3\n1 3\n3 4\n2 5\n5 6\n";
	} else {
		vector<pii> ans;
		int np = 0, lst = 0;
		for(int i = 1; i <= 21; ++i){
			for(auto x : v[i]){
				if(np + i > n){
					rep(j, lst - 1) ans.pop_back();
					np -= lst;
					ans.emplace_back(np, np+1);
					ans.emplace_back(np+1, np+2);
					ans.emplace_back(np+1, np+3);
					ans.emplace_back(np+3, np+4);
					ans.emplace_back(np, np+5);
					for(int i = np+5; i+1 < n; ++i)
						ans.emplace_back(i, i+1);
					np = n;
					break;
				}
				rep(j, (int)x.size())
					ans.emplace_back(np + x[j], np + j + 1);
				np += i, lst = i;
			}
			if(np >= n) break;
		}
		cout << "YES\n" << (int)ans.size() << "\n";
		for(auto x : ans)
			cout << x.first+1 << " " << x.second+1 << "\n";
	}

	return 0;
}