import sys

def solve():
    A = 100
    B = 100
    print(f"{A} {B}", flush=True)

    K_str = sys.stdin.readline().strip()
    K = int(K_str)

    # Mapping from K to X_prime_guess
    # K values are derived from gcd(X_initial, 100^100) where X_initial is in [100, 105]
    # X_initial=100 (2^2 * 5^2) => K=100. X_prime for X=100 is 0.
    # X_initial=101 (prime)     => K=1.   X_prime for X=101 is 1.
    # X_initial=102 (2*3*17)    => K=2.   X_prime for X=102 is 76.
    # X_initial=103 (prime)     => K=1.   X_prime for X=103 is 1.
    # X_initial=104 (2^3*13)    => K=8.   X_prime for X=104 is 76.
    # X_initial=105 (3*5*7)     => K=5.   X_prime for X=105 is 25.

    # If K=1, possible X_initial are 101, 103. Both give X_prime = 1.
    # If K=2, possible X_initial is 102. X_prime = 76.
    # If K=5, possible X_initial is 105. X_prime = 25.
    # If K=8, possible X_initial is 104. X_prime = 76.
    # If K=100, possible X_initial is 100. X_prime = 0.
    
    x_prime_guess = -1 # Should not happen with correct K
    if K == 1:
        x_prime_guess = 1
    elif K == 2:
        x_prime_guess = 76
    elif K == 5:
        x_prime_guess = 25
    elif K == 8:
        x_prime_guess = 76
    elif K == 100:
        x_prime_guess = 0
    
    print(x_prime_guess, flush=True)

if __name__ == '__main__':
    solve()