Given a number x, your task is to find if this number is Deficient number or not. A number x is said to be Deficient Number if sum of all the divisors of the number denoted by *divisorsSum(x)* is less than twice the value of the number x. And the difference between these two values is called the **deficiency**.

Mathematically, if below condition holds the number is said to be Deficient:

**divisorsSum(x) **< 2*x

**deficiency** = (2*x) - divisorsSum(x)

Examples:

```
Input: 21
Output: YES
Divisors are 1, 3, 7 and 21. Sum of divisors is 32.
This sum is less than 2*21 or 42.
Input: 12
Output: NO
Input: 17
Output: YES
```

**Input:**

The first line of input contains an integer T denoting the no of test cases.

Then T test cases follow. Each line contains an integer x.

**Output:**

For each test case in a new line print 1 if the no is a Deficient number else print 0.

**Constraints:**

1<=T<=10000

1<=x<=10000

**Example:
Input:**

3

21

12

17

1

0

1

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.

bruceewayne | 192 |

manvirag982 | 178 |

theAwesome | 168 |

shivam123ahuja | 167 |

Core_Ka_Bachha | 160 |

mr_kksparrow | 433 |

manvirag982 | 394 |

TheHandle | 282 |

rajupraaa1234 | 276 |

Exception_404 | 268 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.