Given a number N. Find if it can be expressed as sum of two prime numbers.
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.
For each test case, In new line print "Yes" if it can be expressed, Otherwise print "No".
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.