From 179516bab2657c66134345714bcf192c318403dd Mon Sep 17 00:00:00 2001 From: Ritwik Singh <46321538+ritwiksingh21@users.noreply.github.com> Date: Tue, 13 Oct 2020 19:54:08 +0530 Subject: [PATCH] Update readme.md --- FashionabLee/readme.md | 23 +++++++++++++++++++++-- 1 file changed, 21 insertions(+), 2 deletions(-) diff --git a/FashionabLee/readme.md b/FashionabLee/readme.md index 5c66e6a..757b985 100644 --- a/FashionabLee/readme.md +++ b/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.
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 ≤ t ≤ 10^4) — the number of polygons in the market.
-**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.
+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.
+#### 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 +```