Last Defence

Given two integers A and B. Sequence S is defined as follow:

• S0 = A

•S1 = B

• Si = |Si−1 − Si−2| for i ≥ 2

Count the number of distinct numbers in S.

Input

The first line of the input gives the number of test cases, T. T test cases follow. T is about 100000. Each test case consists of one line — two space-separated integers A, B. (0 ≤ A, B ≤ 1018). Output

For each test case, output one line containing ‘Case #x: y’, where x is the test case number (starting from 1) and y is the number of distinct numbers in S.

Sample Input

2

7 4

3 5

Sample Output

Case #1: 6

Case #2: 5

#include <iostream>
using namespace std;
long long a, b, ans;
int nCase, cCase;
long long calc(long long a, long long b)
{
    long long ret = 0;
    while (b)
    {
        long long t = b;
        ret += a / b;
        b = a % b;
        a = t;
    }
    return ret + 1;
}
int main()
{
    //ios::sync_with_stdio(false);
    cin >> nCase;
    while (nCase--)
    {
        cin >> a >> b;
        if (a == 0 && b == 0)
        {
            ans = 1;
        }
        else if (a == 0 || b == 0)
        {
            ans = 2;
        }
        else
        {
            ans = calc(a, b);
        }
        cout << "Case #" << ++cCase << ": " << ans << endl;
    }
    return 0;
}