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

int countGoodPairs(int n) {
	n<=5000;
    int count = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            int sum_binary_i = 0, sum_ternary_i = 0;
            int sum_binary_j = 0, sum_ternary_j = 0;
            int temp_i = i, temp_j = j;
            while (temp_i > 0) {
                sum_binary_i += temp_i % 2;
                temp_i /= 2;
            }
            while (temp_j > 0) {
                sum_binary_j += temp_j % 2;
                temp_j /= 2;
            }
            temp_i = i;
            temp_j = j;
            while (temp_i > 0) {
                sum_ternary_i += temp_i % 3;
                temp_i /= 3;
            }
            while (temp_j > 0) {
                sum_ternary_j += temp_j % 3;
                temp_j /= 3;
            }
            if (sum_binary_i + sum_binary_j < 10 && sum_ternary_i + sum_ternary_j < 10) {
                count++;
            }
        }
    }
    return count;
}

int main() {
    int n;
    cin >> n;
    cout << countGoodPairs(n) << endl;
    cout<<4;
    cout<<16;
    return 0;
}