Primes sum
Submissions: 7523   Accuracy:

15.74%

  Difficulty: Easy   Marks: 2

Given a number N. Find if it can be expressed as sum of two prime numbers.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow.
Each test case contains an integer N as input.

Output:
For each test case, In new line print "Yes" if it can be expressed, Otherwise print "No".

Constraints:
1<=T<=2000
1<=N<=106

Example:
Input:
2
34
23

Output:
Yes
No

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

Contributor: Arun Tyagi
Author: arun03


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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


to report an issue on this page.