From 8f0293a78436d7ff8ed425db394d1c90b780dfa6 Mon Sep 17 00:00:00 2001
From: Ritwik Singh <46321538+ritwiksingh21@users.noreply.github.com>
Date: Tue, 13 Oct 2020 19:34:43 +0530
Subject: [PATCH] Create readme.md

---
 FashionabLee/readme.md | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 FashionabLee/readme.md

diff --git a/FashionabLee/readme.md b/FashionabLee/readme.md
new file mode 100644
index 0000000..5c66e6a
--- /dev/null
+++ b/FashionabLee/readme.md
@@ -0,0 +1,9 @@
+## FashionabLee
+##### Link: http://codeforces.com/problemset/problem/1369/A
+
+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 OX-axis and at least one of its edges is parallel to the OY-axis at the same time.<br/>
+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).