#include <iostream>
#include <vector>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
typedef long long ll;
using namespace std;
int main() {
    int l; cin >> l;
    vector<ll> dp(l+1);
    ll acc[2] = {};
    repeat (i,l+1) {
        if (i == 0) {
            dp[i] = 1;
        } else if (l%2 == 0 and l/2 == i) {
            dp[i] = 0;
        } else {
            dp[i] = acc[(i+1)%2];
        }
        acc[i%2] += dp[i];
    }
    if (dp[l] == 0) {
        assert (l == 2);
        cout << 4 << endl;
        cout << 1 << endl;
    } else {
        cout << l << endl;
        cout << dp[l] << endl;
    }
    return 0;
}