The modulo parity party You are given an array A of n strictly positive integers, with n ≥ 2.
Your task is to map each entry Ai to:

1 if Aj mod Ai is odd for each j such that 1 ≤ j ≤ n and j ≠ i
2 if Aj mod Ai is even for each j such that 1 ≤ j ≤ n and j ≠ i
0 otherwise (mixed parities)

Example
For A = [ 73, 50, 61 ], we have:

50 mod 73 = 50, 61 mod 73 = 61 → mixed
73 mod 50 = 23, 61 mod 50 = 11 → all odd
73 mod 61 = 12, 50 mod 61 = 50 → all even

Therefore, the expected output is [ 0, 1, 2 ].
Rules

You may use any three distinct values (of any type) instead of 0, 1 and 2 as long as they're consistent. Please specify your mapping if you're not using the one described in the challenge.
Should there be any doubt about that, zero is even.
This is code-golf, so the shortest answer in bytes wins!

Test cases
[ 1, 2 ] --&gt; [ 2, 1 ]
[ 3, 4 ] --&gt; [ 1, 1 ]
[ 1, 2, 3 ] --&gt; [ 2, 1, 0 ]
[ 4, 4, 4 ] --&gt; [ 2, 2, 2 ]
[ 73, 50, 61 ] --&gt; [ 0, 1, 2 ]
[ 941, 459, 533 ] --&gt; [ 1, 0, 0 ]
[ 817, 19, 928, 177 ] --&gt; [ 1, 2, 1, 1 ]
[ 312, 463, 336, 729, 513 ] --&gt; [ 0, 2, 0, 0, 0 ]
[ 53, 47, 33, 87, 81, 3, 17 ] --&gt; [ 0, 0, 0, 1, 0, 2, 0 ]
Python 2, 68 67 66 bytes

-1 byte thanks to Mr. Xcoder
-1 byte thanks to ovs


x=input()
for j in x:k=sum(i%j%2for i in x);print(k&lt;len(x)-1)+0**k


Try it online!

Returns 1,0,2 instead 0,1,2.