神奇的数列之“Last Defence ”

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        long T = sc.nextLong();
        long k = 1L;
        while(T > 0){
            long x = sc.nextLong();
            long y = sc.nextLong();
            long sum = 0L;
            long mod = -1L;
            if(x == 0 && y != 0){System.out.println("Case #" + k + ": 2");}
            else if(x != 0 && y == 0){System.out.println("Case #" + k + ": 2");}
            else if(x == 0 && y == 0){System.out.println("Case #" + k + ": 1");}
            else{
                while(mod != 0){
                    if(x < y){long t = x;x = y;y = t;}
                    sum = sum + x/y;
                    mod = x%y;
                    x = mod;
                }
                sum = sum + 1;
                System.out.println("Case #" + k + ": " + sum);
            }
            k = k + 1;T = T - 1;
        }
    }
}