#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,nn,q,mod=998244353;
ll fp(ll a,ll b){
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
int main(){
	__int128 ans;
	cin>>n;
	nn=n;
	q=1;
	while(nn){
		q*=10;
		nn/=10;
	}
	ans=(n%mod)*(fp(q%mod,n)-1)%mod*(fp((q-1)%mod,mod-2))%mod;
	cout<<(long long)ans<<endl;
	return 0;
}

提交记录：https://atcoder.jp/contests/abc357/submissions/54421351