Two piles once...#2805
Misha divided a number of cones into two piles, with and cones in each pile, respectively, and proposed the following game to Masha: On a turn, the player may take any positive number of cones, but only from one pile. The player who takes the last cone wins. Masha always goes first.
Given and , determine which player will win if both play optimally.
The first line contains an integer (1 \leq N \leq 10^5) — the number of test cases.
Each of the next lines contains two non-negative integers and , each not exceeding 2 \cdot 10^9.
Print a single line without spaces, consisting of digits — each digit is either 1 or 2, where the -th digit is the number of the player who will win in the -th test case if both play optimally.
Example 1