#include <bits/stdc++.h>
//#include <atcoder/all>

typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007; //998244353;

template<class _T> static void get(_T& a) {
	std::cin >> a;
}
template<class _T> static void get(_T& a, _T& b) {
	std::cin >> a >> b;
}
template<class _T> static void get(_T& a, _T& b, _T& c) {
	std::cin >> a >> b >> c;
}
template <class _T> static _T tp_abs(_T a) {
	if (a < (_T)0) {
		a *= (_T)-1;
	}
	return a;
}

static void A();

int main()
{
	A();
	fflush(stdout);
	return 0;
}

static int dfs(std::map<int, int>& lsbs, int nowlsb, int nowCnt, int nowVal, int goal)
{
	if (nowVal == goal) {
		return nowCnt;
	}
	else if (nowlsb > 9) {
		return -1;
	}
	
	int cnt = 0;
	if (lsbs.find(nowlsb) != lsbs.end()) {
		cnt = lsbs[nowlsb];
	}

	int ans = MOD_NUM;
	for (int i = 0; (i <= cnt) && (i < 10); i++) {
		int ret = dfs(lsbs, nowlsb + 1, nowCnt + i, (nowVal + (i * nowlsb)) % 10, goal);
		if (ret >= 0) {
			ans = std::min(ans, ret);
		}
	}
	return ans;
}

static void A()
{
	int N;
	get(N);
	
	int ai, ttl = 0;
	std::map<int, int> lsbs;
	for (int i = 0; i < N; i++) {
		get(ai);
		ttl += ai % 10;
		lsbs[ai % 10]++;
	}

	int ans = N - 1;
	int mod = ttl % 10;
	if (lsbs.find(mod) == lsbs.end()) {
		ans = N - dfs(lsbs, 1, 0, 0, ttl % 10);
	}

	printf("%d\n", ans);
}