Rt，我是预处理出n=5,6,7,8,9的情况，然后硬往上塞，为啥wa了/kk

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<bitset>
using namespace std;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N=510;
int n;
vector<int> s1,s2,s3,s4;
int main()
{
	n=read();
	if(n<=4){
		cout<<"NO";
		return 0;
	}
	cout<<"YES"<<endl;
	int x=n/5-1,p=n-x*5;
	if(p==5)
		x++;
	for(int i=1;i<=x;i++){
		s1.push_back(10+i*50),s2.push_back(10+i*50+1);
		s1.push_back(5+i*50),s2.push_back(20+i*50+1);
		s1.push_back(15+i*50),s2.push_back(20+i*50+1);
		s1.push_back(4+i*50),s2.push_back(16+i*50+1);
		s1.push_back(16+i*50),s2.push_back(16+i*50+1);
		
		s3.push_back(0+i*50),s4.push_back(0+i*50+1);
		s3.push_back(20+i*50),s4.push_back(0+i*50+1);
		s3.push_back(0+i*50),s4.push_back(20+i*50+1);
		s3.push_back(20+i*50),s4.push_back(20+i*50+1);
		s3.push_back(10+i*50),s4.push_back(40+i*50+1);
	}
	if(p==6){
		s1.push_back(2),s2.push_back(4);
		s1.push_back(2),s2.push_back(6);
		s1.push_back(4),s2.push_back(6);
		s1.push_back(6),s2.push_back(4);
		s1.push_back(6),s2.push_back(2);
		s1.push_back(4),s2.push_back(2);
		
		s3.push_back(0),s4.push_back(6);
		s3.push_back(2),s4.push_back(8);
		s3.push_back(6),s4.push_back(6);
		s3.push_back(8),s4.push_back(2);
		s3.push_back(6),s4.push_back(0);
		s3.push_back(2),s4.push_back(2);
	}
	if(p==7){
		s1.push_back(2),s2.push_back(4);
		s1.push_back(2),s2.push_back(6);
		s1.push_back(4),s2.push_back(6);
		s1.push_back(5),s2.push_back(4);
		s1.push_back(6),s2.push_back(4);
		s1.push_back(6),s2.push_back(2);
		s1.push_back(4),s2.push_back(2);
		
		s3.push_back(0),s4.push_back(6);
		s3.push_back(2),s4.push_back(8);
		s3.push_back(6),s4.push_back(6);
		s3.push_back(8),s4.push_back(2);
		s3.push_back(6),s4.push_back(0);
		s3.push_back(3),s4.push_back(0);
		s3.push_back(2),s4.push_back(2);
	}
	if(p==8){
		s1.push_back(2),s2.push_back(4);
		s1.push_back(2),s2.push_back(6);
		s1.push_back(4),s2.push_back(6);
		s1.push_back(5),s2.push_back(4);
		s1.push_back(6),s2.push_back(4);
		s1.push_back(6),s2.push_back(2);
		s1.push_back(4),s2.push_back(2);
		s1.push_back(5),s2.push_back(3);
		
		s3.push_back(0),s4.push_back(6);
		s3.push_back(2),s4.push_back(8);
		s3.push_back(6),s4.push_back(6);
		s3.push_back(8),s4.push_back(2);
		s3.push_back(6),s4.push_back(0);
		s3.push_back(3),s4.push_back(0);
		s3.push_back(2),s4.push_back(2);
		s3.push_back(-4),s4.push_back(6);
	}
	if(p==9){
		s1.push_back(2),s2.push_back(4);
		s1.push_back(2),s2.push_back(6);
		s1.push_back(4),s2.push_back(6);
		s1.push_back(5),s2.push_back(4);
		s1.push_back(6),s2.push_back(4);
		s1.push_back(6),s2.push_back(2);
		s1.push_back(4),s2.push_back(2);
		s1.push_back(5),s2.push_back(3);
		s1.push_back(4),s2.push_back(5);
		
		s3.push_back(0),s4.push_back(6);
		s3.push_back(2),s4.push_back(8);
		s3.push_back(6),s4.push_back(6);
		s3.push_back(8),s4.push_back(2);
		s3.push_back(6),s4.push_back(0);
		s3.push_back(3),s4.push_back(0);
		s3.push_back(2),s4.push_back(2);
		s3.push_back(-4),s4.push_back(6);
		s3.push_back(8),s4.push_back(-1);
	}
	for(int i=0;i<s1.size();i++)
		cout<<s1[i]<<' '<<s2[i]<<endl;
	for(int i=0;i<s3.size();i++)
		cout<<s3[i]<<' '<<s4[i]<<endl;
	return 0;
}
/*
2 4
2 6
4 6
5 4
6 4
6 2
4 2

0 6
2 8
6 6
8 2
6 0
3 0
2 2


2 4
2 6
4 6
6 4
6 2
4 2

0 6
2 8
6 6
8 2
6 0
2 2
*/