OddEve
Practice
5 (1 votes)
Very Easy
Problem
91% Success 465 Attempts 10 Points 1s Time Limit 256MB Memory 1024 KB Max Code
Sarthak is getting married now. His parents are very religious.The monk has told his parents that his marriage will be successful only if he gets married on a Date which is divisible by 2. You need to help his parents to get the dates so that he can have a successful marriage.
INPUT First line will contain an integer T denoting the number of test cases. The following T lines will contain the date N in integer format.
OUTPUT Print "YES" without quotes if his marriage will be successful according to the monk and "NO" without quotes if not.
CONSTRAINTS 1<=N<=1000
Submissions
Please login to view your submissions
Similar Problems
1.Prime
Points:10
1 votes
Tags:
Very-Easy
Points:10
38 votes
Tags:
Math BasicAlgorithmsBasic MathMath
Points:10
79 votes
Tags:
MathematicsBasic MathVery-EasyMathematics
Editorial
No editorial available for this problem.