#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int bitcount(int n) {
    int cnt = 0;
    for ( ; n; n >>= 1) if (n & 1) cnt++;
    return cnt;
}

int main() {
    int x; cin >> x;
    vector<long long> cnt1(17), cnt2(16), sum1(17), sum2(16);
    for (int i = 0; i < 1 << 16; i++) {
        int c = bitcount(i);
        cnt1[c] += 1;
        sum1[c] += i;
    }
    for (int i = 0; i < 1 << 15; i++) {
        int c = bitcount(i);
        cnt2[c] += 1;
        sum2[c] += i << 16;
    }
    long long cnt = 0, sum = 0;
    for (int i = 0; i < 17; i++) for (int j = 0; j < 16; j++) {
        if (i + j == x) {
            cnt += cnt1[i] * cnt2[j];
            sum += cnt1[i] * sum2[j] + cnt2[j] * sum1[i];
        }
    }
    cout << cnt << " " << sum << endl;
    return 0;
}