BETA
Perfect Numbers
Submissions: 12167   Accuracy:

35%

  Difficulty: Easy
     

Given a number and check if a number is perfect or not. A number is said to be perfect if sum of all its factors excluding the number itself is equal to the number.

Input:
First line consists of T test cases. Then T test cases follow .Each test case consists of a number N.

Output:
Output in a single line 1 if a number is a perfect number else print 0.

Constraints:
1<=T<=300
1<=N<=10000

Example:
Input:
2
6
21
Output:
1
0

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

Author: Ayush Saluja


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