#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using mint = atcoder::modint998244353;

int main(){
    int n;
    cin >> n;
    mint ans=0;
    rep(i,n+1)
    rep(j,n+1){
        if(j<i)continue;
        if(__builtin_popcount(i) != __builtin_popcount(j))continue;
        ans+=(i&j);
    }
    cout << ans.val() << endl;
    return 0;
}