#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  mint pow2[64];
  pow2[0] = 1;
  rep(i, 63) pow2[i + 1] = pow2[i] * 2;
  ll m;
  cin >> m;
  int n = __lg(m) + 1;
  mint ans;
  ans += mint(2).pow(1LL << (n - 1)) - 1;
  mint dp[2][2];
  dp[0][0] = 1;
  rrep(k, n - 1) {
    int bit = m >> k & 1;
    mint ndp[2][2];
    mint c = mint(2).pow(1LL << k);
    mint coeff[2][2] = {{c, c}, {1, c * c}};
    rep(i, 2) rep(j, 2) rep(x, 2) rep(pre, 2) {
      if (bit) {
        int ni = i | !x;
        int nj = j | pre;
        ndp[ni][nj] += dp[i][j] * coeff[x][pre];
      } else {
        if (!i && x) continue;
        int ni = i;
        int nj = j | pre;
        ndp[ni][nj] += dp[i][j] * coeff[x][pre];
      }
    }
    swap(dp, ndp);
  }
  ans += dp[1][0] * 2 + dp[1][1];
  cout << ans.val() << '\n';
}