def solve(n):
    ans = 0
    for i in range(n+1):
        for j in range(i, n+1):
            if (i.bit_count() == j.bit_count()):
                ans += i & j
    return ans


n = int(input())
print(solve(n))