#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    mint ans = 0;
    rep(i, n+1)rep(j, n+1){
        bitset<16> b1(i), b2(j);
        if(b1.count() != b2.count())continue;
        bitset<16> b3 = b1 & b2;
        ans += mint(b3.to_ulong());
    }
    mint s = 0;
    rep(i, n+1)s += mint(i);
    mint t = (ans - s)/mint(2);
    cout << (ans - t).val() << endl;

    return 0;
}