You are given two positive integers aa and bb .

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

• Choose any positive odd integer xx (x>0x>0 ) and replace aa with a+xa+x ;
• choose any positive even integer yy (y>0y>0 ) and replace aa with a−ya−y .

You can perform as many such operations as you want. You can choose the same numbers xx and yy in different moves.

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

You have to answer tt independent test cases.

Input

The first line of the input contains one integer tt (1≤t≤1041≤t≤104 ) — the number of test cases.

Then tt test cases follow. Each test case is given as two space-separated integers aa and bb (1≤a,b≤1091≤a,b≤109 ).

Output

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

Example Input  

5
2 3
10 10
2 4
7 4
9 3

Output  

1
0
2
2
1
判断几次就行了。

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a,b;
        cin>>a>>b;
        if(b>a)
        {
            if((b-a)%2!=0)
            {
                cout<<1<<endl;
                continue;
            }
            else
            {
                cout<<2<<endl;
                continue;
            }
        } 
        else if(b==a)
        {
            cout<<0<<endl;
            continue;
        }
        else
        {
            if((a-b)%2!=0)
            {
                cout<<2<<endl;//a先加上1变成偶数 
                continue;
            }
            else cout<<1<<endl;
            continue;
        }
    }
    return 0;
}