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

typedef long long ll;
#define maxn 100010

ll num1[maxn], num2[15], num3[15], n, ans = 0;
int k, p = 0;

inline dfs() {}

inline ll read() {
    char c = getchar();
    ll f = 1, x = 0;
    while (c < '0' || c > '9') {
        if (c == '-')
            f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = (x << 1) + (x << 3) + (c ^ '0');
        c = getchar();
    }
    return (x * f) % 10;
}

int main() {
    memset(num2, 0, sizeof(num2));
    memset(num3, 0, sizeof(num3));
    n = read();
    for (ll i = 0; i < n; i++) {
        num1[i] = (read() + 1) % 10;
        if (num1[i] == 0)
            num2[0]++;
        if (num1[i] == 1)
            num2[1]++;
        if (num1[i] == 2)
            num2[2]++;
        if (num1[i] == 3)
            num2[3]++;
        if (num1[i] == 4)
            num2[4]++;
        if (num1[i] == 5)
            num2[5]++;
        if (num1[i] == 6)
            num2[6]++;
        if (num1[i] == 7)
            num2[7]++;
        if (num1[i] == 8)
            num2[8]++;
        if (num1[i] == 9)
            num2[9]++;
    }
    for (int i = 0; i <= 9; i++)
        for (int j = 0; j <= 9; j++) {
            if (i - j < 0)
                k = 10 + i - j;
            else
                k = i - j;
            num3[i] += num2[j] * k;
        }
    stable_sort(num3, num3 + 10);
    ans = num3[0];
    printf("%lld\n", ans);
    return 0;
}

/sandbox/1/a.cpp:9:8: error: ISO C++ forbids declaration of 'dfs' with no type [-fpermissive]
    9 | inline dfs(){
      |        ^~~
/sandbox/1/a.cpp: In function 'int dfs()':
/sandbox/1/a.cpp:11:1: warning: no return statement in function returning non-void [-Wreturn-type]
   11 | }
      | ^