rt.

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int N = 2e5 + 10, mod = 998244353;

int n, a[N];          
ll s[N], res, d[N];   

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]); 
	s[0] = 0;
	for (int i = 1; i <= n; i++)
		s[i] = s[i - 1] + a[i];
	d[0] = 1; 
	for (int i = 1; i <= 10; i++)
		d[i] = d[i - 1] * 10;
	for (int i = 1; i <= n; i++) 
		res += (s[i - 1] * d[to_string(a[i]).size()] % mod + 1LL * a[i] * (i - 1) % mod);
	printf("%lld\n", res);        
}