mod = 998244353
n = int(input()); assert 0 <= n <= 2*10**3
ans = 0
for a in range(n+1):
    for b in range(a, n+1):
        if bin(a).count("1") == bin(b).count("1"):
            ans += a & b
            ans %= mod

print(ans)