13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T77f,

Maple has two positive integers $$$a$$$ and $$$b$$$. She may perform the following operation any number of times (possibly zero) to make $$$a$$$ equal to $$$b$$$:

Choose any positive integer $$$x$$$, and multiply either $$$a$$$ or $$$b$$$ by $$$x$$$.

Your task is to determine the minimum number of operations required to make $$$a$$$ equal to $$$b$$$. It can be proven that this is always possible.

Input

Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 100$$$). The description of the test cases follows.

The first and only line of each test case contains two positive integers $$$a$$$ and $$$b$$$ ($$$1 \le a, b \le 1000$$$) — the numbers Maple currently has.

Output

For each test case, output a single integer representing the minimum number of operations Maple needs to make $$$a$$$ equal to $$$b$$$.

Maple and Multiplication

Examples