#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1e9+7;
ll gcd(ll a,ll b){
    if(!b) return a;
    return gcd(b,a%b);
}
ll power(ll a,ll b,ll mod){
    ll ans = 1;
    while(b){
        if(b&1) ans = (ans*a)%mod;
        a = (a*a)%mod;
        b >>= 1;
    }
    return ans;
}

int main(){
    int a = 100,b = 132;
    cout << a << " " << b << endl;
    ll ret;
    cin >> ret;
    map<int,int> sol;
    for(int x = 100; x <= 100000; x++){
        ll y = power(a,b,mod);
        ll k = gcd(x,y);
        ll x_prime = power(x,a,b);
        if(sol.count(k) && sol[k] != x_prime){
            cout << a << ' ' << b << endl;
            return 0;
        }
        sol[k] = x_prime;
    }
    cout << sol[ret] << endl;
    return 0;    
}