You've got two numbers. As long as they are both larger than zero, they go through the same operation: subtract the lesser number from the larger one. If they equal substract one number from the another. For example, one operation transforms pair (4,17) to pair (4,13), it transforms (5,5) to (0,5).

You've got some number of pairs (ai, bi). How many operations will be performed for each of them?

Input

The first line contains the number of pairs n (1 ≤ n ≤ 1000). Then follow n lines, each line contains a pair of positive integers ai, bi (1 ≤ ai, bi ≤ 109).

Output

Print the sought number of operations for each pair on a single line.

Examples

Input

2
4 17
7 987654321


Output

8
141093479
#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int anum, bnum, n, sum = 0, re = 0, a, b;
  scanf("%I64d", &n);
  while (n--) {
    scanf("%I64d %I64d", &a, &b);
    while (a && b) {
      sum += a / b;
      anum = a % b;
      a = b;
      b = anum;
    }
    printf("%I64d\n", sum);
    sum = 0;
  }
  return 0;
}
