 Permutation divisibility
##### Submissions: 1105   Accuracy: 21.77%   Difficulty: Easy   Marks: 2

You are given a number. Your task is to check if there exists a permutation of the digits of this number which is divisible by 4.

Input:
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consists of one line. The line consists of a non negative integer N. This integer may have leading zeros.

Output:
Corresponding to each test case, in a new line, print 1 if such a permutation of this number exists or print 0 if such a permutation doesn't exist.

Constraints:
1 ≤ T ≤ 100
0 ≤ N ≤ 10200

Example:
Input:
3
003
715
123456

Output:
1
0
1

Explanation:
For 003, we have a permutation 300 which is divisible by 4.
For 123456, we have 123564 which is a permutation of 123456 and is divisible by 4.

#### ** For More Input/Output Examples Use 'Expected Output' option **

Author: Hemang Sarkar

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.