import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n=II()+1
bl=n.bit_length()
inv=(md+1)//2
ans=0
t=1
for k in range(bl):
    dp=[0]*(bl+1)
    jp=0
    jv=1
    for i in range(bl)[::-1]:
        pre,dp = dp,[0]*(bl+1)
        for p in range(bl):
            if pre[p]==0:continue
            if i!=k:
                dp[p]+=pre[p]
                dp[p]%=md
            dp[p+1]+=pre[p]
            dp[p+1]%=md
        if i!=k and n>>i&1:
            dp[jp]+=jv
        if i==k and n>>i&1==0:jv=0
        jp+=n>>i&1
        # print(i,dp)
    c=0
    for d in dp:
        c+=d*(d+1)%md
        c%=md
    ans+=c*inv%md*t%md
    ans%=md
    # print(k,ans,dp)
    t=t*2%md
print(ans)