#include <iostream>

bool noCarryInBinary(int num1, int num2) {
    int sum = num1 + num2;
    while (num1 > 0 || num2 > 0 || sum > 0) {
        int bit1 = num1 & 1;
        int bit2 = num2 & 1;
        int bitSum = sum & 1;
        if ((bit1 & bit2) && bitSum == 0) return false;
        num1 >>= 1;
        num2 >>= 1;
        sum >>= 1;
    }
    return true;
}

bool noCarryInTernary(int num1, int num2) {
    int sum = num1 + num2;
    int carry = 0;
    while (num1 > 0 || num2 > 0 || sum > 0) {
        int digit1 = num1 % 3;
        int digit2 = num2 % 3;
        int digitSum = digit1 + digit2 + carry;
        if (digitSum >= 3) return false;
        carry = digitSum / 3;
        num1 /= 3;
        num2 /= 3;
        sum /= 3;
    }
    return true;
}

int countGoodPairs(int n) {
    int count = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (noCarryInBinary(i, j) && noCarryInTernary(i, j)) {
                count++;
            }
        }
    }
    return count;
}

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