Forever 0.5 FZU - 2140

Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following conditions:

1. The distance between any two points is no greater than 1.0.

2. The distance between any point and the origin (0,0) is no greater than 1.0.

3. There are exactly N pairs of the points that their distance is exactly 1.0.

4. The area of the convex hull constituted by these N points is no less than 0.5.

5. The area of the convex hull constituted by these N points is no greater than 0.75.

Input

The first line of the date is an integer T, which is the number of the text cases.

Then T cases follow, each contains an integer N described above.

1 <= T <= 100, 1 <= N <= 100

Output

For each case, output “Yes” if this kind of set of points exists, then output N lines described these N points with its coordinate. Make true that each coordinate of your output should be a real number with AT MOST 6 digits after decimal point.

Your answer will be accepted if your absolute error for each number is no more than 10-4.

Otherwise just output “No”.

See the sample input and output for more details.

Sample Input

3
2
3
5

Sample Output

No
No
Yes
0.000000 0.525731
-0.500000 0.162460
-0.309017 -0.425325
0.309017 -0.425325
0.500000 0.162460

Hint

This problem is special judge.

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;

const double PI=acos(-1.0);
/*
这个思维题真的是考验数学
我直接就没有办法了，不是说我们一个一个的加上，看看能不能
找到什么规律，我当时主要是考虑到一个问题，我们构造的
图形的面积怎么求，不会，所以这一个点就很难受。

还有就是强大的分析能力，那个0.5，如果不选中间的点的话，就会小于0.5
所以就会一直WA，还是数学没学好。 
*/

int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n;
		scanf("%d",&n);
		if(n<=3){
			printf("No\n");
			continue;
		}
		printf("Yes\n");
		printf("0 0\n");
		printf("1 0\n");
		printf("%.6f %.6f\n",cos(PI/3.0),sin(PI/3.0));
		double sum=PI/3.0;
		for(int i=4;i<=n;i++){
			printf("%.6f %.6f\n",cos(sum/2.0),sin(sum/2.0));
		}
	}
	return 0;
}