#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

const int N = 1e6+1;

constexpr int mod = 998244353;
int dp[N];
int sdp[N];

void add(int &x, int y){
    x += y;
    if(x >= mod)x -= mod;
}

void sub(int &x,int y){
    x -= y;
    if(x < 0)x += mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    dp[0] = sdp[0] = 1;
    for(int i=1;i<=n;i++){
        dp[i] = sdp[i-1];
        sdp[i] = sdp[i-1];
        int j = 0;
        for(int k=0;k<30;k++){
            if((1<<k)&i)j = k;
        }
        for(int k=0;k<j;k++){
            if((1<<k)&i){
                int v = sdp[(1<<(k+1)) - 1];
                sub(v, sdp[(1<<k)-1]);
                sub(dp[i], v);
            }
        }
        add(sdp[i], dp[i]);
    }
    cout << (sdp[n]-1+mod)%mod << endl;
}