#pragma GCC optimize("O3")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")	
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma") 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
//#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

const long long int MOD = 998244353;

vector <vector<long long int>> mul(vector <vector<long long int>> a, vector<vector<long long int>> b)
{
    int n = a.size();
    int m = a[0].size();
    int k = b[0].size();
    vector <vector<long long int>>c(n, vector<long long int>(k,0));

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            for (int k = 0; k < m; k++)
            {
                c[i][j] += ((a[i][k]%MOD) * (b[k][j]%MOD)%MOD);
                c[i][j] %= MOD;
            }
        }
    }

    return c;
}

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

    vector <vector<long long int>> A(4,vector<long long int>(4,0));
    vector <vector<long long int>> B(4,vector<long long int>(4,0));

	long long int n;

	cin >> n;

	n-=1;

	A[0][0] = 1;
	A[0][3] = 1;
	A[1][0] = 1;
	A[1][3] = 1;
	A[2][2] = 1;
	A[2][3] = 1;
	A[3][2] = 1;
	B[0][0] = 1;
	B[1][1] = 1;
	B[2][2] = 1;
	B[3][3] = 1;
	
	while(n > 0)
	{
		if(n%2==1)
		{
			B = mul(A,B);
		}
		A = mul(A,A);
		n/=2;
	}

	long long int res = B[0][2] + B[0][3];
	res%=MOD;

	cout << res << '\n';

	return 0;
}