#include using namespace std; typedef pair pii; typedef pair pli; typedef pair > piii; typedef long long ll; const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f; ll res; int n, m, cnt, w[N]; inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; } char s[N]; int main() { printf("396 199\n"); fflush(stdout); int x; scanf("%d", &x); if (x % 199) puts("1"); else puts("0"); fflush(stdout); return 0; }