#include #include #include #include #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(i, n) for (ll i = 0; i < ll(n); ++i) #define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i) #define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d) #define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__) #define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--) #define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--) #define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d) #define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define SUM(a) accumulate(all(a),0LL) #define MIN(a) *min_element(all(a)) #define MAX(a) *max_element(all(a)) #define SORT(a) sort(all(a)); #define REV(a) reverse(all(a)); #define SZ(a) int(a.size()) #define popcount(x) __builtin_popcountll(x) #define pf push_front #define pb push_back #define ef emplace_front #define eb emplace_back #define ppf pop_front #define ppb pop_back #ifdef __LOCAL #define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; } #else #define debug(...) void(0); #endif #define INT(...) int __VA_ARGS__;scan(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__) #define STR(...) string __VA_ARGS__;scan(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__) #define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__) using namespace std; using namespace __gnu_pbds; using ll = long long; using ld = long double; using P = pair; using LP = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vvd = vector; using vs = vector; using vc = vector; using vvc = vector; using vb = vector; using vvb = vector; using vp = vector

; using vvp = vector; using vlp = vector; using vvlp = vector; template using PQ = priority_queue, vector>, greater>>; template istream &operator>>(istream &is, pair &p) { return is >> p.first >> p.second; } template ostream &operator<<(ostream &os, const pair &p) { return os << '{' << p.first << ", " << p.second << '}'; } template istream &operator>>(istream &is, tuple &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); } template ostream &operator<<(ostream &os, const tuple &t) { return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}'; } template istream &operator>>(istream &is, vector &v) { for (T &t: v) { is >> t; } return is; } template ostream &operator<<(ostream &os, const vector &v) { os << '['; rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", "); return os << ']'; } template ostream &operator<<(ostream &os, const deque &v) { os << '['; rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", "); return os << ']'; } template ostream &operator<<(ostream &os, const set &st) { os << '{'; auto it = st.begin(); while (it != st.end()) { os << (it == st.begin() ? "" : ", ") << *it; it++; } return os << '}'; } template ostream &operator<<(ostream &os, const multiset &st) { os << '{'; auto it = st.begin(); while (it != st.end()) { os << (it == st.begin() ? "" : ", ") << *it; it++; } return os << '}'; } template ostream &operator<<(ostream &os, const map &mp) { os << '{'; auto it = mp.begin(); while (it != mp.end()) { os << (it == mp.begin() ? "" : ", ") << *it; it++; } return os << '}'; } template void vecout(const vector &v, char div = '\n') { rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div); } template bool constexpr chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template bool constexpr chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } void scan() {} template void scan(Head &head, Tail &... tail) { cin >> head; scan(tail...); } template void print(const T &t) { cout << t << '\n'; } template void print(const Head &head, const Tail &... tail) { cout << head << ' '; print(tail...); } template void fin(const T &... a) { print(a...); exit(0); } template vector &operator+=(vector &v, T x) { for (T &t: v) t += x; return v; } template vector &operator-=(vector &v, T x) { for (T &t: v) t -= x; return v; } template vector &operator*=(vector &v, T x) { for (T &t: v) t *= x; return v; } template vector &operator/=(vector &v, T x) { for (T &t: v) t /= x; return v; } struct Init_io { Init_io() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout << boolalpha << fixed << setprecision(15); cerr << boolalpha << fixed << setprecision(15); } } init_io; const string yes[] = {"no", "yes"}; const string Yes[] = {"No", "Yes"}; const string YES[] = {"NO", "YES"}; const int inf = 1001001001; const ll linf = 1001001001001001001; void rearrange(const vi &) {} template void rearrange(const vi &ord, vector &head, Tail &...tail) { assert(ord.size() == head.size()); vector ori = head; rep(i, ord.size()) head[i] = ori[ord[i]]; rearrange(ord, tail...); } template void sort_by(vector &head, Tail &... tail) { vi ord(head.size()); iota(all(ord), 0); sort(all(ord), [&](int i, int j) { return head[i] < head[j]; }); rearrange(ord, head, tail...); } bool in_rect(int i, int j, int h, int w) { return 0 <= i and i < h and 0 <= j and j < w; } template vector cumsum(const vector &v, bool shift_one = true) { int n = v.size(); vector res; if (shift_one) { res.resize(n + 1); rep(i, n) res[i + 1] = res[i] + v[i]; } else { res.resize(n); if (n) { res[0] = v[0]; rep(i, 1, n) res[i] = res[i - 1] + v[i]; } } return res; } vvi graph(int n, int m, bool directed = false, int origin = 1) { vvi G(n); rep(_, m) { INT(u, v); u -= origin, v -= origin; G[u].pb(v); if (!directed) G[v].pb(u); } return G; } template vector>> weighted_graph(int n, int m, bool directed = false, int origin = 1) { vector>> G(n); rep(_, m) { int u, v; T w; scan(u, v, w); u -= origin, v -= origin; G[u].eb(v, w); if (!directed) G[v].eb(u, w); } return G; } template class modint { ll x; public: constexpr modint(ll x = 0) : x((x % mod + mod) % mod) {} static constexpr int get_mod() { return mod; } constexpr int val() const { return x; } constexpr modint operator-() const { return modint(-x); } constexpr modint &operator+=(const modint &a) { if ((x += a.val()) >= mod) x -= mod; return *this; } constexpr modint &operator++() { return *this += 1; } constexpr modint &operator-=(const modint &a) { if ((x += mod - a.val()) >= mod) x -= mod; return *this; } constexpr modint &operator--() { return *this -= 1; } constexpr modint &operator*=(const modint &a) { (x *= a.val()) %= mod; return *this; } constexpr modint operator+(const modint &a) const { modint res(*this); return res += a; } constexpr modint operator-(const modint &a) const { modint res(*this); return res -= a; } constexpr modint operator*(const modint &a) const { modint res(*this); return res *= a; } constexpr modint pow(ll t) const { modint res = 1, a(*this); while (t > 0) { if (t & 1) res *= a; t >>= 1; a *= a; } return res; } template friend istream &operator>>(istream &, modint &); // for prime mod constexpr modint inv() const { return pow(mod - 2); } constexpr modint &operator/=(const modint &a) { return *this *= a.inv(); } constexpr modint operator/(const modint &a) const { modint res(*this); return res /= a; } // constraints : mod = 2 or val = 0 or val^((mod-1)/2) ≡ 1 // mod is prime // time complexity : O(log^2 p) // reference : https://nyaannyaan.github.io/library/modulo/mod-sqrt.hpp modint sqrt() const { if (x < 2) return x; assert(this->pow((mod - 1) >> 1).val() == 1); modint b = 1; while (b.pow((mod - 1) >> 1).val() == 1) b += 1; ll m = mod - 1, e = 0; while (~m & 1) m >>= 1, e += 1; modint X = this->pow((m - 1) >> 1); modint Y = (*this) * X * X; X *= *this; modint Z = b.pow(m); while (Y.val() != 1) { ll j = 0; modint t = Y; while (t.val() != 1) { j += 1; t *= t; } Z = Z.pow(1LL << (e - j - 1)); X *= Z; Z *= Z; Y *= Z; e = j; } return X; } }; using modint998244353 = modint<998244353>; using modint1000000007 = modint<1000000007>; template istream &operator>>(istream &is, modint &a) { ll x; is >> x; a = modint(x); return is; } template constexpr ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); } template constexpr bool operator==(const modint &a, const modint &b) { return a.val() == b.val(); } template constexpr bool operator!=(const modint &a, const modint &b) { return a.val() != b.val(); } template constexpr modint &operator++(modint &a) { return a += 1; } template constexpr modint &operator--(modint &a) { return a -= 1; } using mint = modint998244353; using vm = vector; using vvm = vector; template class rerooting { using T = typename D::T; int n; vvi tree; vector> dp; vector ans; T dfs(int u = 0, int p = -1) { T sum = D::id; dp[u].resize(tree[u].size()); rep(i, tree[u].size()) { int v = tree[u][i]; if (v == p) continue; dp[u][i] = dfs(v, u); sum = D::merge(sum, D::add_root(dp[u][i], u, v)); } return sum; } void dfs2(T dpP, int u = 0, int p = -1) { int sz = tree[u].size(); rep(i, sz) if (tree[u][i] == p) dp[u][i] = dpP; vector sumL(sz + 1, D::id), sumR(sz + 1, D::id); rep(i, sz) sumL[i + 1] = D::merge(sumL[i], D::add_root(dp[u][i], u, tree[u][i])); rrep(i, sz) sumR[i] = D::merge(sumR[i + 1], D::add_root(dp[u][i], u, tree[u][i])); ans[u] = sumL[sz]; rep(i, sz) { int v = tree[u][i]; if (v == p) continue; T t = D::merge(sumL[i], sumR[i + 1]); dfs2(t, v, u); } rep(i, sz) ls[u].pb(D::add_root(dp[u][i], u, tree[u][i])); } public: vector> ls; explicit rerooting(const vvi &tree) : n(tree.size()), tree(tree), dp(n), ans(n), ls(n) { dfs(); dfs2(D::id); }; }; vm ofs; class D { public: using T = pair; static constexpr T id = {0, 0}; static constexpr T merge(const T &l, const T &r) { return {l.first + r.first, l.second + r.second}; } static T add_root(const T &x, int u, int v) { return {(x.first + 1) * ofs[v], x.second + 1}; } }; int main() { vm p10(20, 1); rep(i, 1, 20) p10[i] = p10[i - 1] * 10; INT(n); vs a(n); scan(a); ofs.resize(n); rep(i, n) ofs[i] = p10[SZ(a[i])]; vvi G = graph(n, n - 1); rerooting rt(G); auto ls = rt.ls; mint ans; rep(i, n) { ll now = stol(a[i]); for (auto [sum, sz]: ls[i]) { ans += sum * now * (n - sz); } ans += mint(now) * n; } fin(ans); }