blackboards
There are N
blackboards  T_{1} ... T_{N}

with some integers written on them.
We can perform repeatedly the following operations: select a blackboard,
then select a pair of integers of the same parity, erase them and wite their sum or
difference on the blackboard. For each blackboard, determine whether it is possible
to have a single number on it.
Input Specification
The first line is an integer 1 ≤ N ≤ 100
: the number of blackboards,
then N
lines follow, each with a description of a blackboard. The first integer
1 ≤ h ≤ 1000
tells us how many numbers the actual blackboard have, then
h
comma separated positive integers follow, each of which not larger than
10^{6}
.
Output Specification
A single line with a length N
string, whose k
th character
is 1
if for the k
th blackboard we can reach the "single number" state
or 0
otherwise.
Sample Input 1
4
3 1 2 3
4 2 2 2 2
1 1
4 2 2 2 1
download as text file
Sample Output 1
1110
download as text file
Sample Input 2
2
1 3
1 2
download as text file
Sample Output 2
11
download as text file