/* -*- coding: utf-8 -*-
 *
 * 3115.cc:  No.3115 One Power One Kill - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MIN_X = 100;
const int MAX_X = 100000;
const int MOD = 1000000007;

/* typedef */

using vb = vector<bool>;
using vi = vector<int>;

/* typedef */

/* global variables */

vb primes;
vi pnums;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

/* main */

int main() {
  int pn = gen_primes(MAX_X);

  int pk = lower_bound(pnums.begin(), pnums.end(), MIN_X + 1) - pnums.begin();

  srand(time(nullptr));
  int p = pnums[rand() % (pn - pk) + pk];

  printf("%d %d\n", p - 1, p); fflush(stdout);

  int k;
  scanf("%d", &k);

  puts("1"); fflush(stdout);

  //for (int i = 0; i < 1e9; i++);
  return 0;
}