#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (auto &&i : v) scanf("%d", &i);
    vector<int> cnt(10);
    int S = 0;
    for (int i = 0; i < n; ++i) {
        S += v[i]%10;
        cnt[v[i]%10]++;
    }
    vector<int> dp(10, INF<int>), dp2;
    dp[S%10] = 0;
    for (int i = 1; i < 10; ++i) {
        dp2 = dp;
        for (int j = 0; j < 10; ++j) {
            for (int k = 1; k <= min(9, cnt[i]); ++k) {
                chmin(dp2[(j+k*(10-i))%10], dp[j]+k);
            }
        }
        swap(dp, dp2);
    }
    cout << n-dp[0] << "\n";
    return 0;
}