Semi Prime
Submissions: 972   Accuracy:

26.51%

  Difficulty: Basic   Marks: 1

Given a positive integer n. Find whether a number is a semiprime or not. Print True if number is semiprime else False. A semiprime is a natural number that is a product of two prime numbers .

Input:
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.


Output:
Print 'True' if it is semi prime,otherwise print 'False'.


Constraints:

1<=T<=100

1<=N<=100000
Example:

Input:

2

6

8

Output:

True

False

Explanation:
Testcase 1 : N=6, True
6 is a semiprime number as it is a product of two prime numbers 2 and 3.

Testcase 2: N = 8 , False

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

Contributor: Sahil Chhabra
Author: Sahil_Chhabra


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.