// Problem: No.2156 ぞい文字列 No.2156 小串
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2156
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int MOD = 998244353;
const int sz = 2;
struct MAT {
  ll a[sz][sz];
  inline MAT() { memset(a, 0, sizeof a); }
  inline MAT operator-(const MAT& T) const {
    MAT res;
    for (int i = 0; i < sz; ++i)
      for (int j = 0; j < sz; ++j) {
        res.a[i][j] = (a[i][j] - T.a[i][j]) % MOD;
      }
    return res;
  }
  inline MAT operator+(const MAT& T) const {
    MAT res;
    for (int i = 0; i < sz; ++i)
      for (int j = 0; j < sz; ++j) {
        res.a[i][j] = (a[i][j] + T.a[i][j]) % MOD;
      }
    return res;
  }
  inline MAT operator*(const MAT& T) const {
    MAT res;
    int r;
    for (int i = 0; i < sz; ++i)
      for (int k = 0; k < sz; ++k) {
        r = a[i][k];
        for (int j = 0; j < sz; ++j)
          res.a[i][j] += T.a[k][j] * r, res.a[i][j] %= MOD;
      }
    return res;
  }
  inline MAT operator^(ll x) const {
    MAT res, bas;
    for (int i = 0; i < sz; ++i) res.a[i][i] = 1;
    for (int i = 0; i < sz; ++i)
      for (int j = 0; j < sz; ++j) bas.a[i][j] = a[i][j] % MOD;
    while (x) {
      if (x & 1) res = res * bas;
      bas = bas * bas;
      x >>= 1;
    }
    return res;
  }
};

void solve() {
  ll n;
  cin >> n;
  n -= 1;
  MAT a, b;
  a.a[0][0] = a.a[0][1] = 1;
  b.a[0][0] = b.a[0][1] = b.a[1][0] = 1;
  b = b ^ n;
  a = a * b;
  cout << (a.a[0][0] - 1 + MOD) % MOD << "\n";
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}