#include <bits/stdc++.h>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef long long li;
typedef long double lf;

inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 

vector<pair<li, li>> a;

int main(){
    // freopen("wonderful.ans", "r", stdin);
    // freopen("www.ww", "w", stdout); 
	li n = read();
	if(n <= 4){
		puts("Yes");
		for(li i = 1; i <= n; i++) printf("0 %lld\n", i);
		puts("0");
		return 0;
	}
	if(n <= 6 || (n % 2) == 1) {
		puts("No");
		return 0;
	}
	printf("Yes\n1 0\n-1 0\n0 1\n0 -1\n");
	a.push_back({1, 3}), a.push_back({1, 4}), a.push_back({3, 4}), a.push_back({2, 3}), a.push_back({2, 4});
	for(li i = 6; i <= n; i += 2){
		if(i % 4 == 2){
			if(i == n - 2) printf("10000000 10000\n-10000000 10000\n");
			else printf("%lld 0\n%lld 0\n", i, -i);
			for(li j = i - 5; j < i - 1; j++){
				if(j % 4 != 2) a.push_back({i - 1, j});
				if(j % 4 != 1) a.push_back({i, j});
			}
		} else{
			if(n - 2 == i) printf("10000 10000000\n10000 -10000000\n");
			else printf("%lld %lld\n%lld %lld\n", i, -i);
			for(li j = i - 5; j < i - 1; j++){
				if(j % 4 != 0) a.push_back({i - 1, j});
				if(j % 4 != 3) a.push_back({i, j});
			}
		}
	} 
	a.push_back({n - 2, n - 3});
	printf("%lld\n", (li)a.size());
	for(auto [x, y] : a) printf("%lld %lld\n", x, y);
    return 0;
}