#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;

template <class T>
struct cntsum {
  T a, b;  // a+bx mod x^2
  friend cntsum operator+(const cntsum& lhs, const cntsum& rhs) { return {lhs.a + rhs.a, lhs.b + rhs.b}; }
  friend cntsum operator-(const cntsum& lhs, const cntsum& rhs) { return {lhs.a - rhs.a, lhs.b - rhs.b}; }
  friend cntsum operator*(const cntsum& lhs, const cntsum& rhs) { return {lhs.a * rhs.a, lhs.a * rhs.b + lhs.b * rhs.a}; }
  friend cntsum operator*(const T& c, const cntsum& x) { return {x.a, x.b + c * x.a}; }
  cntsum& operator+=(const cntsum& x) { return *this = *this + x; }
  cntsum& operator-=(const cntsum& x) { return *this = *this - x; }
  cntsum& operator*=(const cntsum& x) { return *this = *this * x; }
};

using CS = cntsum<mint>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;
  cin >> n;
  mint eqs = mint(n) * (n + 1) / 2;
  CS f[2][2][61][61];
  f[0][0][0][0] = {1, 0};
  mint p2 = 1;
  while (n) {
    CS g[4][4][61][61];
    rep(i, 2) rep(j, 2) rep(pi, 61) rep(pj, 61) {
      auto& val = f[i][j][pi][pj];
      if (!val.a.val() && !val.b.val()) continue;
      rep(di, 2) rep(dj, 2) {
        g[i+di][j+dj][pi+di][pj+dj] += di && dj ? p2 * val : val;
      }
      val = {};
    }
    rrep(i, 3) rrep(j, 4) rep(pi, 61) rep(pj, 61) {
      g[i+1][j][pi][pj] += g[i][j][pi][pj];
    }
    rrep(i, 4) rrep(j, 3) rep(pi, 61) rep(pj, 61) {
      g[i][j+1][pi][pj] += g[i][j][pi][pj];
    }
    for (int i = n & 1; i < 4; i += 2) {
      for (int j = n & 1; j < 4; j += 2) {
        int ni = i / 2, nj = j / 2;
        rep(pi, 61) rep(pj, 61) f[ni][nj][pi][pj] = g[i][j][pi][pj];
      }
    }
    n >>= 1;
    p2 *= 2;
  }
  mint ans;
  rep(pi, 61) ans += f[0][0][pi][pi].b;
  ans = (ans + eqs) / 2;
  cout << ans.val() << '\n';
}