#include <bits/stdc++.h>

using namespace std;
#define SZ(x) (int) (x).size()
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(auto i = (a); i < (b); i++)
#define For(i, a, b, c) \
	for(auto i = (a); i != (b); i += (c))
#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), (v).end())
#define eb emplace_back

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll LINF = 1e18;
const double math_PI = acos(-1);

template<typename T>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(
		a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(
	T& t, const V& v) {
	t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(
	T& t, const V& v) {
	for(auto& e: t) fill_v(e, v);
}

template<class T>
bool chmax(T& a, const T& b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

template<class T>
bool chmin(T& a, const T& b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}

template<typename S, typename T>
istream& operator>>(istream& is, pair<S, T>& p) {
	cin >> p.first >> p.second;
	return is;
}

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}

template<typename T>
string join(vector<T>& vec, string splitter) {
	stringstream ss;
	REP(i, SZ(vec)) {
		if(i != 0) ss << splitter;
		ss << vec[i];
	}
	return ss.str();
}

template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	os << join(vec, " ");
	return os;
}
template<typename T>
vector<vector<T>> multiMatrix(const vector<vector<T>> &A,
							  const vector<vector<T>> &B) {
	int N = SZ(A);
	int M = SZ(B[0]);
	int L = SZ(A[0]);
	auto ret = make_v<T>(N, M);
	REP(i, N) {
		REP(j, M) {
			REP(k, L) {
				ret[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return ret;
}

template<typename T>
vector<vector<T>> powMatrix(const vector<vector<T>> &A,
							ll p) {
	auto ans = make_v<T>(SZ(A), SZ(A));
	REP(i, SZ(A)) ans[i][i] = 1;
	auto mul = A;
	for(; p > 0; p >>= 1) {
		if((p & 1) == 1) ans = multiMatrix(ans, mul);
		mul = multiMatrix(mul, mul);
	}
	return ans;
}

#include <atcoder/all>
using namespace atcoder;

using mint = modint998244353;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll N;
	cin >> N;
	N -= 2;
	auto dp = make_v<mint>(2, 2);
	auto ini = make_v<mint>(2, 1);
	dp[0][0] = 1;
	dp[0][1] = 1;
	dp[1][0] = 1;
	dp[1][1] = 0;
	ini[0][0] = 1;
	ini[1][0] = 1;
	auto pow_dp = powMatrix(dp, N);
	auto mul_dp = multiMatrix(pow_dp, ini);
	mint ans = 0;
	REP(i, 2) {
		ans += mul_dp[i][0];
	}
	cout << (ans - 1).val() << endl;
	return 0;
}