BETA

Difficulty Level: Basic

Submissions: 2269 Accuracy:

47.2%

Prime Number
       

For a given number check if it is prime or not. A prime number is a number which is only divisible by 1 and itself.
 

Input:
First line contains an integer, the number of test cases 'T'. Each test case should contain a positive integer N.


Output:
Print "Yes" if it is a prime number else print "No".


Constraints:
1<= T <=30
1<= N <=100


Example: 

Input:
1
5

Output:
Yes

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.