### A. FashionabLee

A. FashionabLee time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Lee is going to fashionably decorate his house for a party, using some regular convex polygons... Lee thinks a regular 𝑛 n -sided (convex) polygon is beautiful if and only if he can rotate it in such a way that at least one of its edges is parallel to the 𝑂 𝑋 O X -axis and at least one of its edges is parallel to the 𝑂 𝑌 O Y -axis at the same time. Recall that a regular 𝑛 n -sided polygon is a convex polygon with 𝑛 n vertices such that all the edges and angles are equal. Now he is shopping: the market has 𝑡 t regular polygons. For each of them print YES if it is beautiful and NO otherwise. Input The first line contains a single integer 𝑡 t ( 1 ≤ 𝑡 ≤ 10 4 1 ≤ t ≤ 10 4 ) — the number of polygons in the market. Each of the next 𝑡 t lines contains a single integer 𝑛 𝑖 n i (