#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
template <class T>
inline T bigMod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  long long n;
  cin >> n;
  string s;
  vector<long long> pw(30);
  pw[0] = 1;
  for (int i = int(1); i < int(30); i++)
    pw[i] = pw[i - 1] * 10 % (int)(998244353);
  long long sz, res = 0, d;
  for (int i = int(0); i < int(n); i++) {
    cin >> s;
    sz = s.size();
    reverse(s.begin(), s.end());
    for (long long j = 0, p = 0; j < sz; j++, p += 2) {
      d = s[j] - '0';
      res = (res + d * pw[p] * n % (int)(998244353)) % (int)(998244353);
      res = (res + d * pw[p + 1] * n % (int)(998244353)) % (int)(998244353);
    }
  }
  cout << res << endl;
  return 0;
}
