Given a number n, check if it is Full Prime or not.
Note : A full prime number is one in which the number itself is prime and all its digits are also prime.
The first line of the input contains a single integer T, denoting the number of test cases. Then T test case follows, a single line of the input containing a positive integer N.
Print 'Yes' if it is full prime,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.