|All-time Popular Problems|
|Sort a stack|
|Delete Middle of Linked List|
|BFS traversal of graph|
|Largest subarray of 0's and 1's|
|Immediate Smaller Element|
|Delete nodes having greater value on right|
|Node at a given index in linked list|
|Two numbers with sum closest to zero|
|Print all nodes that don’t have sibling|
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.
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.
Print "Divisible" (without quotes) if the number is divisible by 999.
Print "Not divisible" (without quotes) if the number is not divisible by 999.
1<=length of string<=10^9