#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  const int mod = 998244353;
  int n;
  cin >> n;
  vector<vector<int>> v(12);
  for (int i = 0; i <= n; ++i) v[__builtin_popcount(i)].push_back(i);
  long long ans = 0;
  for (int i = 0; i < 12; ++i)
  {
    int siz = v[i].size();
    for (int j = 0; j < siz; ++j)
    {
      for (int k = j; k < siz; ++k) ans += (v[i][j] & v[i][k]);
    }
  }
  cout << ans % mod << endl;
}