//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
//#pra gma G CC opti mize(3)
using namespace std;
using std::bitset;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x ) {
		if(x==0){
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		register int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
#define mod 998244353
template<int N,int M>
struct mat {
	long long v[N+1][M+1];
	mat() {
		memset(v,0,sizeof(v));
	}
	long long & operator()(register int xpos,register int ypos) {
		return v[xpos][ypos];
	}
	long long * operator[](register int xpos) {
		return v[xpos];
	}
	inline int Nsize() {
		return N;
	} inline int Msize() {
		return M;
	}
};
template<int N,int M,int K>
inline mat<N,K> operator*(mat<N,M> a,mat<M,K> b) {
	mat<N,K>rt;
	for(register int i=1; i<=N; i++) {
		for(register int j=1; j<=K; j++) {
			for(register int k=1; k<=M; k++) {
				rt.v[i][j]+=a.v[i][k]*b.v[k][j];
#ifdef mod
				rt.v[i][j]%=mod;
#else
#warning mod is not defined
#endif
			}
		}
	}
	return rt;
}
template<int N,int M>
inline mat<N,M> operator*(mat<N,M> a,long long x) {
	mat<N,M>rt;
	for(register int i=1; i<=N; i++) {
		for(register int j=1; j<=M; j++) {
#ifdef mod
			rt.v[i][j]=a.v[i][j]*x%mod;
#else
			rt.v[i][j]=a.v[i][j]*x;
#endif
		}
	}return rt;
}
template<int N,int M>
inline mat<N,M> operator+(mat<N,M> a,mat<N,M> b) {
	mat<N,M>rt;
	for(register int i=1; i<=N; i++) {
		for(register int j=1; j<=M; j++) {
#ifdef mod
			rt.v[i][j]=((a.v[i][j]+b.v[i][j]<mod)?(a.v[i][j]+b.v[i][j]):(a.v[i][j]+b.v[i][j]-mod));
#else
			rt.v[i][j]=a.v[i][j]+b.v[i][j];
#endif
		}
	}return rt;
}
template<int N>
inline mat<N,N> pw(mat<N,N> bot,long long p) {
	mat<N,N>rt;
	F(i,1,N)rt.v[i][i]=1;
	while(p) {
		if(p&1) {
			rt=rt*bot;
		}
		bot=bot*bot,p>>=1;
	}
	return rt;
}
struct S{
	mat<4,4> a,b,c,d;
};
inline S operator*(S x,S y){
	return {x.a*y.a+x.b*y.c,x.a*y.b+x.b*y.d,x.c*y.a+x.d*y.c,x.c*y.b+x.d*y.d};
}
inline S pw(S bot,long long p) {
	S rt;
	F(i,1,4)rt.a[i][i]=rt.d[i][i]=1;
//	F(i,1,p)rt=rt*bot;
//	return rt;
	while(p) {
		if(p&1) {
			rt=rt*bot;
		}
		bot=bot*bot,p>>=1;
	}
	return rt;
}
mat<4,4>base,T1,T2,T3;
S B,TB;
int main() {//1,082,565 101331
	base[1][2]=45,base[1][3]=9,base[1][4]=9;
	T1[1][1]=T1[3][3]=T1[4][4]=9,T1[2][2]=90,T1[3][2]=45;
	T2[1][1]=T2[2][1]=T2[4][3]=T2[4][4]=1;
	T3[1][1]=T3[2][3]=T3[4][4]=1;
	B.a=base;
	TB.a=TB.c=T1,TB.b=T2+T3;
	ll n;cin>>n;
	B=B*pw(TB,n-1);
	cout<<(B.a[1][1]+B.a[1][2])%mod;
	return 0;
}