#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int N;
    cin >> N;
    int A[N];
    int b[10]{};
    int s = 0;
    
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        A[i] %= 10;
    }
    int d[N + 1][10]{};
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j < 10; j++) {
            d[i][j] = -1;
        }
    }
    d[0][0] = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < 10; j++) {
            d[i + 1][j] = d[i][j];
        }
        for (int j = 0; j < 10; j++) {
            if (d[i][j] != -1) {
                int t = (j + A[i]) % 10;
                d[i + 1][t] = max(d[i + 1][t], d[i][j] + 1);
            }

        }
    }
    cout << d[N][0] << "\n";
    return 0;
}