#include<bits/stdc++.h>
using namespace std;
int k;
int A[8][6]={
    0,0,9,4,0,20,
    0,20,9,4,10,20,
    10,20,9,4,11,4,
    10,20,11,4,20,20,
    20,0,20,20,11,4,
    0,0,10,0,9,4,
    10,0,11,4,9,4,
    10,0,20,0,11,4
},B[9][6]={
    0,0,20,0,16,12,
    0,0,16,12,0,20,
    0,20,12,14,13,20,
    20,0,20,13,16,12,
    16,16,16,12,20,13,
    16,16,20,13,20,20,
    16,16,20,20,13,20,
    16,16,13,20,12,14,
    16,16,12,14,16,12
},C[10][6]={
    0,0,10,8,0,20,
    20,0,10,8,20,20,
    0,20,10,8,20,20,
    0,0,8,0,5,4,
    10,3,5,4,8,0,
    10,3,10,8,5,4,
    10,3,8,0,12,0,
    10,3,12,0,15,4,
    10,3,15,4,10,8,
    20,0,15,4,12,0
};
queue<vector<int>> q;
void solve(int a[][6],int n){
	for(int i=0;i<n;++i){
		vector<int> now;
		for(int j=0;j<6;++j) now.push_back(a[i][j]*50000000);
		q.push(now);
	}
	while(q.size()<k){
		auto now=q.front(); q.pop();
		int x1=now[0],y1=now[1],x2=now[0]+now[2]>>1,y2=now[1]+now[3]>>1,x3=now[2],y3=now[3],x4=now[2]+now[4]>>1,y4=now[3]+now[5]>>1,x5=now[4],y5=now[5],x6=now[4]+now[0]>>1,y6=now[5]+now[1]>>1;
		q.push({x1,y1,x2,y2,x6,y6});
		q.push({x2,y2,x6,y6,x4,y4});
		q.push({x2,y2,x3,y3,x4,y4});
		q.push({x6,y6,x4,y4,x5,y5});
	}
	while(!q.empty()){
		auto now=q.front(); q.pop();
		printf("%d %d %d %d %d %d\n",now[0],now[1],now[2],now[3],now[4],now[5]);
	}
}
int main(){
	scanf("%d",&k);
	if(k>=8){
		puts("Yes");
		if(k%3==2) solve(A,8);
		if(k%3==0) solve(B,9);
		if(k%3==1) solve(C,10);
	}else puts("No");
	
	return 0;
}