import sys

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

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

    # For any X in [100, 105], X^A mod B will be 1.
    # gcd(X, 121) == 1 for X in [100, 105]
    # lambda(121) = lambda(11^2) = 11^(2-1) * (11-1) = 11 * 10 = 110
    # So X^110 = 1 (mod 121) for gcd(X,121)=1.
    # The judge might change X, but the new X will still be in [100, 105].
    # So X_new^A mod B will also be 1.
    
    X_prime_guess = 1
    print(X_prime_guess, flush=True)

    # ret = int(sys.stdin.readline())
    # This part is for local testing or if the problem expects to read the result.
    # In a reactive problem, the judge will terminate or give WA/AC based on the output.

if __name__ == '__main__':
    solve()