Chef has a number N, Cheffina challenges the chef to check the divisibility of all the permutation of N by 3. If any of the permutations is divisible by 3 then print 1 else print 0.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains a single line of input, two integers $N$. 
-----Output:-----
For each test case, output in a single line answer 1 or 0.
-----Constraints-----
- $1 \leq T \leq 10^6$
- $1 \leq N \leq 10^6$
-----Sample Input:-----
2
18
308
-----Sample Output:-----
1
0
from sys import *
input=stdin.readline
for u in range(int(input())):
    s=int(input())
    if(s%3==0):
        print(1)
    else:
        print(0)

from sys import *
input=stdin.readline
for u in range(int(input())):
    s=int(input())
    if(s%3==0):
        print(1)
    else:
        print(0)
