#include"bits/stdc++.h"

using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;
using pll = pair<ll, ll>;
using tp3 = tuple<ll, ll, ll>;
constexpr int INF = 1 << 28;
constexpr ll INFL = 1ll << 60;
constexpr int dh[4] = { 0,1,0,-1 };
constexpr int dw[4] = { -1,0,1,0 };
bool isin(const int H, const int W, const int h, const int w) {
    return 0 <= h && h < H && 0 <= w && w < W;
}
// ============ template finished ============

int main()
{
    int N;
    cin >> N;
    vector<ll> A(N);
    rep(i, N)cin >> A[i];

    vector<int> remains(10, INF);
    remains[0] = 0;
    for (auto a : A) {
        rep(bef, 10) {
            auto next = (bef + a) % 10;
            remains[next] = min(remains[next], remains[bef] + 1);
        }
    }

    ll tgt = accumulate(A.begin(), A.end(), 0ll) % 10;
    ll res = N - remains[tgt];
    cout << res << endl;
    return 0;
}