You are given an n-digit large number, you have to check whether it is divisible by 999 without dividing or finding modulo of number by 999.
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 an string denoting the number.
Output:
Print "Divisible" (without quotes) if the number is divisible by 999.
Print "Not divisible" (without quotes) if the number is not divisible by 999.
Constraints:
1<=T<=10^5
1<=length of string<=10^9
Example:
Input:
2
1998
999999999
Output:
Divisible
Not divisible
blackshadows | 242 |
xmyqsh | 216 |
hanuman001 | 172 |
Adarsh Trivedi | 168 |
layman_brother | 168 |
blackshadows | 724 |
xmyqsh | 557 |
aman19 | 402 |
r0c2048 | 360 |
kspk | 331 |
akhayrutdinov | 5005 |
Ibrahim Nash | 4871 |
Quandray | 4338 |
sanjay05 | 3668 |
blackshadows | 3228 |