import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write @lru_cache(maxsize=None) def solve(X,Y,bl): if X==0: retu=0 else: if bl: retu=max(0,Y-1) else: retu=max(0,(Y-1)//2) retu+=solve(X>>1,Y>>1,bl) if Y>=1: retu+=solve(X>>1,(Y-1)>>1,bl) if X>=1: retu+=solve((X-1)>>1,Y>>1,bl) if X>=1 and Y>=1: retu+=solve((X-1)>>1,(Y-1)>>1,True) retu%=mod return retu mod=998244353 N=int(readline()) ans=solve(N,N,False) print(ans)