#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>

using namespace std;

map<vector<int>, int> f;

void back(vector<int> &v) {
  if (f.count(v))
    return;

  f[v] = 1;
  for (int i = 1; i < v.size(); ++i) {
    reverse(v.begin(), v.begin() + i);
    reverse(v.begin() + i, v.end());
    back(v);
    reverse(v.begin() + i, v.end());
    reverse(v.begin(), v.begin() + i);
  }
}

void solve() {
  long long n;
  cin >> n;
  if (n <= 2) {
    cout << 1 << "\n";
  } else {
    cout << 2 * n % 998244353;
  }
  
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);

  int t = 1;
  while (t--)
    solve();

  return 0;
}