#include <stdio.h>
void merge(int b[], int start, int end, int n);
void mergesoft(int a[], int start, int end, int n);
int main(int argc, char *argv[]) {
    int n, i, c = 0, k, p;
    scanf("%d", &n);
    int a[n + 5], b[10];
    for (i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        if (a[i] >= 10) {
            a[i] = (a[i] + 1) % 10;
            c++;
        }
    }
    mergesoft(a, 1, n, n);
    k = a[n];
    for (i = 0; i < 10; i++) b[i] = c;
    while (k > a[1]) {
        p = 0;
        for (i = 1; i <= n; i++) {
            if (k == a[i]) {
                p = 1;
                break;
            }
        }
        if (p == 1) {
            for (i = 1; i <= n; i++) {
                if (k >= a[i])
                    b[k] += k - a[i];
                else
                    b[k] += k + 10 - a[i];
            }
        }
        k--;
    }
    mergesoft(b, 0, 9, 10);
    for (i = 0; i < 10; i++) {
        if (b[9] > c) {
            if (b[i] > c) {
                printf("%d", b[i]);
                break;
            }
        } else {
            printf("%d", c);
            break;
        }
    }
    return 0;
}
void merge(int a[], int start, int end, int n) {
    int mid = (start + end) / 2;
    if (start >= end)
        return;
    int c[n];
    int i = start;
    int j = mid + 1;
    int k = 0;
    while (i <= mid && j <= end) {
        if (a[i] < a[j]) {
            c[k++] = a[i++];
        } else {
            c[k++] = a[j++];
        }
    }
    if (i == mid + 1) {
        while (j <= end) c[k++] = a[j++];
    }
    if (j == end + 1) {
        while (i <= mid) c[k++] = a[i++];
    }
    for (j = 0, i = start; j < k; i++, j++) {
        a[i] = c[j];
    }
}
void mergesoft(int a[], int start, int end, int n) {
    if (start >= end)
        return;
    int mid = (start + end) / 2;
    mergesoft(a, start, mid, n / 2);
    mergesoft(a, mid + 1, end, n - n / 2);
    merge(a, start, end, n);
    return;
}