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

Source: codechef | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
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 stdin, stdout
input = stdin.readline
from collections import defaultdict as dd
import math

def geti():
	return list(map(int, input().strip().split()))

def getl():
	return list(map(int, input().strip().split()))

def gets():
	return input().strip()

def geta():
	return int(input())

def print_s(s):
	stdout.write(s + '\n')

def solve():
	for _ in range(geta()):
		n = geta()
		if n % 3 == 0:
			print(1)
		else:
			print(0)

def __starting_point():
	solve()
__starting_point()