#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;

const long long MOD = 1000000007;

long long mod_exp(long long base, long long exp, long long mod) {
    long long result = 1;
    base = base % mod;
    while (exp > 0) {
        if (exp % 2 == 1) {
            result = (result * base) % mod;
        }
        exp = exp >> 1;
        base = (base * base) % mod;
    }
    return result;
}

int main() {
    // First, pick some reasonable values for A and B
    int A = 123, B = 456;
    
    // Output A and B
    cout << A << " " << B << endl;
    cout.flush();

    // Get the gcd(X, Y) from the judge
    int K;
    cin >> K;

    // Now, you can make a guess about X'
    // In a real solution, this would depend on the received K value and your logic
    // For simplicity, we'll assume we guess the value of X' based on the info we have
    
    int X_prime = 64;  // Example guess
    
    cout << X_prime << endl;
    cout.flush();

    // Check the result
    int ret;
    cin >> ret;
    
    if (ret == 1) {
        cout << "Success! The guess is correct." << endl;
    } else {
        cout << "Fail. The guess was incorrect." << endl;
    }

    return 0;
}