Codeforces Round 624 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

greedy

implementation

math

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Add Odd or Subtract Even

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given two positive integers $$$a$$$ and $$$b$$$.

In one move, you can change $$$a$$$ in the following way:

- Choose any positive odd integer $$$x$$$ ($$$x > 0$$$) and replace $$$a$$$ with $$$a+x$$$;
- choose any positive even integer $$$y$$$ ($$$y > 0$$$) and replace $$$a$$$ with $$$a-y$$$.

You can perform as many such operations as you want. You can choose the same numbers $$$x$$$ and $$$y$$$ in different moves.

Your task is to find the minimum number of moves required to obtain $$$b$$$ from $$$a$$$. It is guaranteed that you can always obtain $$$b$$$ from $$$a$$$.

You have to answer $$$t$$$ independent test cases.

Input

The first line of the input contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

Then $$$t$$$ test cases follow. Each test case is given as two space-separated integers $$$a$$$ and $$$b$$$ ($$$1 \le a, b \le 10^9$$$).

Output

For each test case, print the answer — the minimum number of moves required to obtain $$$b$$$ from $$$a$$$ if you can perform any number of moves described in the problem statement. It is guaranteed that you can always obtain $$$b$$$ from $$$a$$$.

Example

Input

5 2 3 10 10 2 4 7 4 9 3

Output

1 0 2 2 1

Note

In the first test case, you can just add $$$1$$$.

In the second test case, you don't need to do anything.

In the third test case, you can add $$$1$$$ two times.

In the fourth test case, you can subtract $$$4$$$ and add $$$1$$$.

In the fifth test case, you can just subtract $$$6$$$.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/28/2024 19:51:15 (l3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|