#include<bits/stdc++.h>
using namespace std;
int A[15][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
};
int b[15][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
};
int c[15][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
};
struct node{
    int x1,y1,x2,y2,x3,y3;
};
int a[15][6];
void solve(int k){
    int r=k%3,ed;
    if(r==2)ed=8;else if(!r)ed=9;else ed=10;
    queue<node>q;
    int num=5e7;
    for(int i=0;i<ed;i++){
        q.push({a[i][0]*num,a[i][1]*num,a[i][2]*num,a[i][3]*num,a[i][4]*num,a[i][5]*num});
        // q.push({a[i][0],a[i][1],a[i][2],a[i][3],a[i][4],a[i][5]});
    }
    while((int)q.size()<k){
        node now=q.front();q.pop();
        int x1=now.x1,y1=now.y1,x2=now.x2,y2=now.y2,x3=now.x3,y3=now.y3;
        int x4,y4,x5,y5,x6,y6;
        x4=(x1+x2)>>1;y4=(y1+y2)>>1;
        x5=(x1+x3)>>1;y5=(y1+y3)>>1;
        x6=(x2+x3)>>1;y6=(y2+y3)>>1;
        if(x4==min(x1,x2)||y4==min(y1,y2)||
        x5==min(x1,x3)||y5==min(y1,y3)||
        x6==min(x3,x2)||y6==min(y3,y2)){q.push(now);continue;}
        q.push({x1,y1,x4,y4,x5,y5});
        q.push({x4,y4,x5,y5,x6,y6});
        q.push({x2,y2,x4,y4,x6,y6});
        q.push({x3,y3,x5,y5,x6,y6});
    }
    while(k--){
        node now=q.front();q.pop();
        printf("%d %d %d %d %d %d\n",now.x1,now.y1,now.x2,now.y2,now.x3,now.y3);
    }
}

int main(){
    int k;
     scanf("%d",&k);
     
    //~ cout<<(dis(0,5e8,5e7,27)>dis(0,5e8,5e8,5e8));
    if(k<8)printf("No\n");
    else{
        printf("Yes\n");
        if(k%3==2)swap(A,a);
        else if(!k%3)swap(a,b);
        else swap(a,c);
        solve(k);
    }
    return 0;
}