Kickstart Round A 2018 Problem A

T = int(input())
max_n = 10**16
 
def findOddNumber(n, cnt, t):
 
    eo = list(int(x) % 2 for x in n)
 
    # 모든 수가 짝수면  리턴
    if 1 not in eo:
        return cnt    
 
    for i in range(len(n)):
 
        if eo[i] == 0:
            continue
 
       # 자릿수
        cipher = len(n) - i - 1
        cipherN = int("1" + "0" * cipher)
 
        remain = 0
 
       # 나머지
        if len(n) > i+1:
            remain = int(n[i+1:])
        else:
            return cnt + 1
 
        res1 = max_n
        res2 = max_n
       
       # sol A
        if (t is "A" or t is "C") :
            need = cipherN - remain
            n1 = int(n) + need
            cnt1 = cnt + need
            res1 = findOddNumber(str(n1), cnt1, "A")    
 
       # sol B
        if (t is "B" or t is "C") :
            n2 = int(n) - (remain + 2)
            cnt2 = cnt + (remain + 2)
            res2 = findOddNumber(str(n2), cnt2, "B")
      
        return min(res1, res2)
 
for t in range(1, T+1) :
  
   ans = findOddNumber(input(), 0, "C")
   print("Case #{}: {}".format(t, ans))