#include <bits/stdc++.h>
using namespace std;
void _main();
int main() {
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;
ll N;
ll SUM = 0;
void DNC(ll mod,ll nokori, ll cnt) {

	if (cnt == 0)return;
	cout << mod << " " << 1 << endl;
	cout << nokori << " " << endl;
	// 그대로 nokori
	// 아님 nokori + mod/2임 
	ll cnt1 = 0;
	cin >> cnt1;
	ll cnt2 = cnt-cnt1;
	if (mod >= N) {
		if (nokori == 0) {
			SUM += N*cnt1;
		} else {
			SUM += nokori*cnt1;
		}
		// nokori2 
		SUM += (nokori+mod/2)*cnt2;
		return;
	}
	DNC(mod*2, nokori, cnt1);
	DNC(mod*2, nokori+mod/2, cnt2);

	return;
}

void _main() {
	// N으로 나눈 나머지 이분
	cin >> N;

	DNC(2, 0, 5);
	cout << "0 1" << endl;
	cout <<SUM << endl;










}