#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::dynamic_modint<-1>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll a = 100, b = 132;
  cout << a << ' ' << b << '\n';
  cout.flush();
  ll k;
  cin >> k;
  ll y = atcoder::modint1000000007(a).pow(b).val();
  mint::set_mod(b);
  for (ll x = 100; x <= 100000; x++) {
    ll g = __gcd(x, y);
    if (g == k) {
      cout << mint(x).pow(a).val() << '\n';
      cout.flush();
      ll ret;
      cin >> ret;
      return;
    }
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}