#include <stdio.h>

// Correct function prototype
void merge_sort(int l, int r, int arr[]);

int main() {
    int n;
    int step = 0;
    int one = 0, two = 0;
    scanf("%d", &n);
    int arr[n];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    // Pass correct array indices to merge_sort

    merge_sort(0, n - 1, arr);

    for (int i = 0; i < n; i++) {
        if (arr[i] < 10) {
            one = 1;
        } else if (arr[i] >= 10) {
            two = 1;
        }
    }

    if (one == 1 && two == 0) {
        for (int i = 0; i < n - 1; i++) {
            while (arr[i] != arr[n - 1]) {
                arr[i] = (arr[i] + 1) % 10;
                step++;
                if (arr[i] == arr[n - 1]) {
                    break;
                }
            }
        }
    } else if (one == 1 && two == 1 || one == 0 && two == 1) {
        for (int i = 0; i < n; i++) {
            if (arr[i] >= 10) {
                arr[i] = (arr[i] + 1) % 10;
                step++;
            }
        }
        merge_sort(0, n - 1, arr);
        for (int j = 0; j < n - 1; j++) {
            while (arr[j] != arr[n - 1]) {
                arr[j] = (arr[j] + 1) % 10;
                step++;
            }
            if (arr[j] == arr[n - 1]) {
                break;
            }
        }
    }

    printf("%d\n", step);
    return 0;
}

// Correct function name to merge_sort
void merge_sort(int l, int r, int arr[]) {
    int store[r + 1];
    if (l == r) {
        return;
    }
    int mid = (l + r) / 2;
    merge_sort(l, mid, arr);
    merge_sort(mid + 1, r, arr);
    int p1 = l, p2 = mid + 1, p = l;
    while (p1 <= mid || p2 <= r) {
        if (p1 > mid) {
            store[p] = arr[p2];
            p2++;
        } else if (p2 > r) {
            store[p] = arr[p1];
            p1++;
        } else if (arr[p1] <= arr[p2]) {
            store[p] = arr[p1];
            p1++;
        } else {
            store[p] = arr[p2];
            p2++;
        }
        p++;
    }
    for (int i = l; i <= r; i++) {
        arr[i] = store[i];
    }
    return;
}