#include <bits/stdc++.h> using namespace std; int n; const int MX = 2e5+5; long long a[MX], b[MX]; long long sum = 0; int main() { ios::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i]; long long x = a[i]; while (x != 0) { sum += x % 10; x /= 10; } } sum *= 2 * n; // 这里要看，不太理解 for (long long i = 10; i < 10000000000000000ll; i *= 10) { for (int j = 1; j <= n; ++j) { b[j] = a[j] % i; } sort(b + 1, b + 1 + n); long long g = 0; for (int j = 1; j <= n; ++j) { g += n - (lower_bound(b + 1, b + 1 + n, i - b[j]) - b) + 1; // 这里的处理要看 } sum -= g * 9; // 这里还好 } cout << sum << endl; return 0; }