#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long pow(long long a, long long k, long long m)
{
  long long ret = 1;
  for (a %= m; k > 0; k >>= 1, a = a * a % m) if (k & 1) ret = ret * a % m;
  return ret;
}

int main()
{
  const int mod = 1e9 + 7;
  int a = 390, b = 131;
  cout << a << ' ' << b << endl;
  int y = pow(a, b, mod);
  int k;
  cin >> k;
  cout << (k % b == 0 ? 0 : 1) << endl;
  int ret;
  cin >> ret;
}