import sys
from math import sqrt

def _try_composite(a, d, n, s):
    if pow(a, d, n) == 1:
        return False
    for i in xrange(s):
        if pow(a, 2**i * d, n) == n-1:
            return False
    return True # n  is definitely composite
 
def is_prime(n, _precision_for_huge_n=16):
    if n in _known_primes or n in (0, 1):
        return True
    if any((n % p) == 0 for p in _known_primes):
        return False
    d, s = n - 1, 0
    while not d % 2:
        d, s = d >> 1, s + 1
    # Returns exact according to http://primes.utm.edu/prove/prove2_3.html
    if n < 1373653: 
        return not any(_try_composite(a, d, n, s) for a in (2, 3))
    if n < 25326001: 
        return not any(_try_composite(a, d, n, s) for a in (2, 3, 5))
    if n < 118670087467: 
        if n == 3215031751: 
            return False
        return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7))
    if n < 2152302898747: 
        return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11))
    if n < 3474749660383: 
        return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13))
    if n < 341550071728321: 
        return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13, 17))
    # otherwise
    return not any(_try_composite(a, d, n, s) 
                   for a in _known_primes[:_precision_for_huge_n])
 
_known_primes = [2, 3]
_known_primes += [x for x in xrange(5, 1000, 2) if is_prime(x)]

def getDivisor(n):
    for i in (i for i in xrange(2, int(sqrt(n))+1) if n % i == 0):
        return i

N = 32
J = 500
print "Case #1:"

def do_stuff(x):
    
    divs = []
    for y in xrange(2, 11):
        w = getDivisor(int(x, y))
        divs.append(w)
    
    print x,
    print ' '.join(str(divs[m]) for m in xrange(9))
    sys.stdout.flush()

num = 2147483647
#num = 2147485097
while True:
    x = bin(num)[2:]
    
    num += 2
    naah = 0
    for y in xrange(2, 11):
        if is_prime(int(x, y)):
            naah = 1
            break
    if naah==1 or len(x)<N:
        continue
    
    
    
    do_stuff(x)
    
    J -= 1
    if J == 0:
        break
    
