Isolated Pointset
题号：NC212621
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 64 M，其他语言128 M
64bit IO Format: %lld

题目描述

On a two-dimensional plane, YHH has a series of isolated points named PointSet, which contains N points in it. YHH would like to know if there is a way to draw a vertical bisector from any two points in the PointSet, passing through at least one point in the PointSet. Please help him.

输入描述:

There are multiple test cases. The first line contains an integer T (1 ≤ T ≤ 2 × ), indicating the number of test cases. For each test case:

Then followed T lines,  each line contains an integer N (1 ≤ N ≤ 2 × ), indicating the number of points in the PointSet.

输出描述:

If there is a way to solve this problem, output "Yes"(without quotes), otherwise, output "No"(without quotes) instead.
示例1

输入

复制 
2
4
5

输出

复制 
Yes
Yes

说明

Vertical Bisector(垂直平分线): Line CD is a vertical bisector.
For the first sample, YHH can construct two equilateral triangles ABD, BDC as shown below.
For the second sample, YHH can construct three equilateral triangles ABE, BCE, CDE as shown below.