Three distinct factors
Submissions: 2296   Accuracy:

13.22%

  Difficulty: Basic   Marks: 1

Given a positive integer N. The task is to check whether a number has exactly three distinct factors or not.

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 a number N as input.

Output:
For each test case, print "1" if the number has exactly three distinct factors else print "0".

Constraints:
1<=T<=500
1<=N<=1018

Example:
Input:
2

10
9

Output:
0
1

** 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.