#include<bits/stdc++.h>
using namespace std;
struct pnt{
	double x,y;
};
double gdis(pnt X,pnt Y){
	return sqrt((X.x-Y.x)*(X.x-Y.x)+(X.y-Y.y)*(X.y-Y.y));
}
pnt gmid(pnt X,pnt Y){
	return (pnt){(X.x+Y.x)/2,(X.y+Y.y)/2};
}
pnt A={0,0},B={0,10},C={10,10},D={10,0};
pnt E={4.5,8},F={5.5,8},G={5,10},H={5,0}; 
pnt I={4.7,10},J={5.3,10},K={5,8};
pnt L={8,6},M={8,8},N={6.5,10},O={10,6.3},P={6,7};

struct triangle{
	pnt x,y,z;
};
double glen(triangle X){
	return gdis(X.x,X.y)+gdis(X.y,X.z)+gdis(X.z,X.x);
}
bool operator <(triangle X,triangle Y){
	return glen(X)<glen(Y);
}

triangle fx8[8]={
{A,B,E},{B,G,E},{A,E,H},
{C,D,F},{C,F,G},{D,F,H},
{E,F,G},{E,F,H},
};

triangle fx9[9]={
{B,P,N},{A,B,L},{A,D,L},{D,O,L},
{M,P,N},{M,N,C},{M,C,O},{M,O,L},{M,L,P},
};

triangle fx10[10]={
{A,B,E},{B,I,E},{A,E,H},
{C,D,F},{C,F,J},{D,F,H},
{E,I,K},{J,F,K},{I,J,K},{E,F,H},
};

priority_queue <triangle> q;

int n;
int main(){
	cin>>n;
	if(n<8) return puts("No"),0;
	puts("Yes");
	int st;
	if(n%3==0){
		st=9;
		for(int i=0;i<9;i++) q.push(fx9[i]);
	}
	else if(n%3==1){
		st=10;
		for(int i=0;i<10;i++) q.push(fx10[i]);
	}
	else{
		st=8;
		for(int i=0;i<8;i++) q.push(fx8[i]);
	}
	
	for(int t=1;t<=(n-st)/3;t++){
		triangle u=q.top(); q.pop();
		pnt x=u.x,y=u.y,z=u.z;
		q.push({x,gmid(x,y),gmid(x,z)});
		q.push({y,gmid(y,x),gmid(y,z)});
		q.push({z,gmid(z,x),gmid(z,y)});
		q.push({gmid(x,y),gmid(y,z),gmid(z,x)});
	}
	
	while(q.size()){
		triangle u=q.top(); q.pop();
		pnt x=u.x,y=u.y,z=u.z;
		cout<<setprecision(0)<<fixed<<x.x*1e8<<" "<<x.y*1e8<<" "<<y.x*1e8<<" "<<y.y*1e8<<" "<<z.x*1e8<<" "<<z.y*1e8<<'\n';
//		cout<<setprecision(0)<<fixed<<"Polygon( "<<"("<<x.x*1e8<<", "<<x.y*1e8<<"), ("<<y.x*1e8<<", "<<y.y*1e8<<"), ("<<z.x*1e8<<", "<<z.y*1e8<<") )\n";
	}
}