Update readme.md

FashionabLee/readme.md

@@ -5,5 +5,24 @@ Lee *thinks* a regular n-sided (convex) polygon is beautiful **if and only if**
 Recall that a regular n-sided polygon is a convex polygon with n vertices such that all the edges and angles are equal.<br/>
 Now he is shopping: the market has t regular polygons. For each of them print YES if it is beautiful and NO otherwise.<br/>
 
-**Input** : The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of polygons in the market.<br/>
-**Output** : For each polygon, print YES if it's beautiful or NO otherwise (case insensitive).
+#### Input:
+The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of polygons in the market.<br/>
+Each of the next t lines contains a single integer ni (3 ≤ ni ≤ 10^9): it means that the i-th polygon is a regular ni-sided polygon.<br/>
+#### Output:
+For each polygon, print YES if it's beautiful or NO otherwise (case insensitive).
+###### Example:
+##### Input: 
+```
+4
+3
+4
+12
+1000000000 
+```
+##### Output:
+```
+NO
+YES
+YES
+YES
+```