#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    /*constexpr int r = 100000;
    vector<bool> used(r + 1);
    vector<int> p;
    for(int i = 2; i <= r; i++){
        if(used[i]) continue;
        if(i >= 100){
            for(int j = 1; j * (i - 1) <= 100000; j++){
                if(modpow(j * (i - 1), i, 1'000'000'007) % i == 0){
                    cerr << j * (i - 1) << '\n';
                    return 0;
                }
            }
        }
        for(int j = 2 * i; j <= r; j += i){
            used[j] = true;
        }
    }
    cerr << "enter\n";*/
    cout << 19000 << ' ' << 101 << endl;
    int K;
    cin >> K;
    cout << (K % 101 >= 1) << '\n';
}