#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 3e5 + 5, mod = 998244353;


int tree[(1 << 21) + 1];

void update(int node, int bit, int mask, int val) {
    tree[node] += val;
    if(tree[node] >= mod) tree[node] -= mod;
    if(bit == -1) return;
    if(mask >> bit & 1 ^ 1) update(node << 1, bit - 1, mask, val);
    else update(node << 1 | 1, bit - 1, mask, val);
}

void update(int mask, int val) {
    update(1, 19, mask, val);
}


int get(int node, int bit, int mask, bool f) {
    if(bit == -1) return 0;
    if(mask >> bit & 1) {
        if(f) {
            return get(node << 1, bit - 1, mask, 0);
        }
        else {
            int ret = tree[node << 1 | 1];
            ret += get(node << 1, bit - 1, mask, f);
            if(ret >= mod) ret -= mod;
            return ret;
        }
    }
    else {
        return get(node << 1, bit - 1, mask, f);
    }
}

int get(int mask) {
    return get(1, 19, mask, 1);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    update(1, 1);
    int total = 1;
    for(int i = 2; i <= n; i++) {
        int z = get(i);
        int curAns = (1 + total - z + mod);
        if(curAns >= mod) curAns -= mod;

        update(i, curAns);

        total += curAns;
        if(total >= mod) total -= mod;
    }
    cout << total;


    return 0;
}