import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7


n = II()
aa = LI()
cnt = [0]*10
r = 0
for a in aa:
    a %= 10
    cnt[a] += 1
    r += a
    r %= 10

def chmin(i, j, val):
    if val < dp[i][j]: dp[i][j] = val

dp = [[inf]*10 for _ in range(10)]
dp[0][0] = 0
for i in range(1, 10):
    for j in range(10):
        pre = dp[i-1][j]
        if pre == inf: continue
        for c in range(min(10, cnt[i]+1)):
            chmin(i, (j+c*i)%10, pre+c)

ans = n-dp[9][r]
print(ans)