#include <bits/stdc++.h>
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
#define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
#define rreps(i, n) for(int i=((int)(n)); i>0; --i)
#define all(v) (v).begin(), (v).end()
#define el '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vs = vector<string>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<class T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T> bool chmaxeq(T &a, const T &b) { if (a<=b) { a=b; return 1; } return 0; }
template<class T> bool chmineq(T &a, const T &b) { if (b<=a) { a=b; return 1; } return 0; }
bool yes(bool a=true) { cout << (a?"yes":"no") << el; return a; }
bool no(bool a=true) { cout << (a?"no":"yes") << el; return a; }
bool Yes(bool a=true) { cout << (a?"Yes":"No") << el; return a; }
bool No(bool a=true) { cout << (a?"No":"Yes") << el; return a; }
bool YES(bool a=true) { cout << (a?"YES":"NO") << el; return a; }
bool NO(bool a=true) { cout << (a?"NO":"YES") << el; return a; }
template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p);
template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p);
template<class T> istream &operator>>(istream &is, vector<T> &v);
template<class T> ostream &operator<<(ostream &os, const vector<T> &v);
template<class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
	return is >> p.first >> p.second;
}
template<class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
	return os << p.first << ' ' << p.second;
}
template<class T>
istream &operator>>(istream &is, vector<T> &v) {
	int sz = v.size();
	for (int i = 0; i < sz; i++) is >> v[i];
	return is;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
	int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) os << ' ';
		os << v[i];
	}
	return os;
}
void _main();
int main() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(16); _main(); return 0; }


template<class T>
concept gnu_integral = requires {
	requires (integral<T> || same_as<__int128_t, T> || same_as<__uint128_t, T>);
};

template<class T>
concept gnu_signed_integral = requires {
	requires (signed_integral<T> || same_as<__int128_t, T>);
};

template<class T>
concept gnu_unsigned_integral = requires {
	requires (unsigned_integral<T> || same_as<__uint128_t, T>);
};

/**
 * @brief 冪乗の剰余を求める。
 *
 * O(log y)
 * @tparam _int `mod` の型
 * @tparam _long `_int` の倍の精度の整数型
 * @param x 底
 * @param y 指数
 * @param mod 法
 * @return 冪乗の剰余
 */
template<gnu_integral _int, gnu_integral _long>
constexpr _int pow_mod(_long x, _long y, _int mod) {
	if (y == 0) return 1 % mod;
	_long res = pow_mod<_int, _long>(x, y/2, mod);
	res = res*res%mod;
	if (y % 2 == 1) res = res*x%mod;
	return res;
}

void _main() {
	vi v(100100, -1);
	int A = 23040;
	int B = 6144;
	int Y = pow_mod<int, ll>(A, B, 1000000007);
	bool ok = true;
	for (int X = 100; X <= 100000; X++) {
		int K = gcd(X, Y);
		int Xd = pow_mod<int, ll>(X, A, B);
		v[K] = Xd;
	}
	cout << A << ' ' << B << endl;
	int K; cin >> K;
	cout << v[K] << endl;
	int res; cin >> res;
	assert(res == 1);
}