#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll n;
    cin >> n;

    ll LB = 61;
    vector<vector<vector<vector<mint>>>> dp1(LB, 
    vector<vector<vector<mint>>>(LB, 
    vector<vector<mint>>(2, 
    vector<mint>(2))));
    vector<vector<vector<vector<mint>>>> dp2(LB, 
    vector<vector<vector<mint>>>(LB, 
    vector<vector<mint>>(2, 
    vector<mint>(2))));
    dp1[0][0][0][0] = mint(1);

    for (ll x = 59; x >= 0; x--){
        vector<vector<vector<vector<mint>>>> ndp1(LB, 
        vector<vector<vector<mint>>>(LB, 
        vector<vector<mint>>(2, 
        vector<mint>(2))));
        vector<vector<vector<vector<mint>>>> ndp2(LB, 
        vector<vector<vector<mint>>>(LB, 
        vector<vector<mint>>(2, 
        vector<mint>(2))));

        for (ll i = 0; i < LB - 1; i++){
            for (ll j = 0; j < LB - 1; j++){
                for (ll k = 0; k < 2; k++){
                    for (ll l = 0; l < 2; l++){
                        ndp1[i + k][j + l][1][1] += dp1[i][j][1][1];
                        ndp2[i + k][j + l][1][1] += dp2[i][j][1][1];
                        ndp2[i + k][j + l][1][1] += dp1[i][j][1][1] * mint(k) * mint(l) * mint(1LL << x);
                    }
                }
                if ((n >> x) & 1){
                    for (ll k = 0; k < 2; k++){
                        for (ll l = 0; l < 2; l++){
                            ndp1[i + k][j + l][1 - k][1 - l] += dp1[i][j][0][0];
                            ndp2[i + k][j + l][1 - k][1 - l] += dp2[i][j][0][0];
                            ndp2[i + k][j + l][1 - k][1 - l] += dp1[i][j][0][0] * mint(k) * mint(l) * mint(1LL << x);
                        }
                    }
                    for (ll k = 0; k < 2; k++){
                        for (ll l = 0; l < 2; l++){
                            ndp1[i + k][j + l][1][1 - l] += dp1[i][j][1][0];
                            ndp2[i + k][j + l][1][1 - l] += dp2[i][j][1][0];
                            ndp2[i + k][j + l][1][1 - l] += dp1[i][j][1][0] * mint(k) * mint(l) * mint(1LL << x);
                        }
                    }
                    for (ll k = 0; k < 2; k++){
                        for (ll l = 0; l < 2; l++){
                            ndp1[i + k][j + l][1 - k][1] += dp1[i][j][0][1];
                            ndp2[i + k][j + l][1 - k][1] += dp2[i][j][0][1];
                            ndp2[i + k][j + l][1 - k][1] += dp1[i][j][0][1] * mint(k) * mint(l) * mint(1LL << x);
                        }
                    }
                }
                else{
                    ndp1[i][j][0][0] += dp1[i][j][0][0];
                    ndp2[i][j][0][0] += dp2[i][j][0][0];
                    for (ll k = 0; k < 2; k++){
                        ndp1[i + k][j][1][0] += dp1[i][j][1][0];
                        ndp2[i + k][j][1][0] += dp2[i][j][1][0];
                    }
                    for (ll l = 0; l < 2; l++){
                        ndp1[i][j + l][0][1] += dp1[i][j][0][1];
                        ndp2[i][j + l][0][1] += dp2[i][j][0][1];
                    }
                }
            }
        }

        for (ll i = 0; i < LB; i++){
            for (ll j = 0; j < LB; j++){
                for (ll k = 0; k < 2; k++){
                    for (ll l = 0; l < 2; l++){
                        dp1[i][j][k][l] = ndp1[i][j][k][l];
                        dp2[i][j][k][l] = ndp2[i][j][k][l];
                    }
                }
            }
        }
    }
    mint ans = mint(0);
    for (ll i = 0; i < LB; i++){
        for (ll j = 0; j < 2; j++){
            for (ll k = 0; k < 2; k++){
                ans += dp2[i][i][j][k];
            }
        }
    }
    mint ans_same = mint(n) * mint(n + 1) / mint(2);
    ans = ans_same + (ans - ans_same) / mint(2);
    cout << ans.val() << endl;
}