#include using namespace std; using ll = long long; using ld = long double; using vl = vector; using vd = vector; using vs = vector; using vb = vector; using vvl = vector>; using vvd = vector>; using vvs = vector>; using vvb = vector>; using pll = pair; constexpr ll mod= 1e9 + 7; #define ALL(x) (x).begin(), (x).end() #define REP(i, n) for(ll(i)= 0; (i) < (n); (i)++) #define REPS(i, n) for(ll(i)= 1; (i) <= (n); (i)++) #define RREP(i, n) for(ll(i)= (n - 1); (i) >= 0; (i)--) #define RREPS(i, n) for(ll(i)= (n); (i) > 0; (i)--) #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define UNIQUE(v) v.erase(unique(ALL(v)), v.end()) #define YES(n) ((n) ? "YES" : "NO") #define Yes(n) ((n) ? "Yes" : "No") #define yes(n) ((n) ? "yes" : "no") template inline void chmin(T& a, T b) { if(a > b) { a= b; } } template inline void chmax(T& a, T b) { if(a < b) { a= b; } } signed main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); vl ten(10); ll N; cin >> N; REP(i,N){ ll tmp; cin >> tmp; ten[tmp%10]++; } vvl dp(11,vl(10,-500000000000)); dp[0][0] = 0; REP(i,10){ vl tes(10); REP(l,10){ chmax(tes[i*l%10],max((ll)0,(ten[i]%10 >= l ?10*(ten[i]/10) + l : 10*(ten[i]/10 - 1)+ l))); } REP(l,10){ chmax(dp[i+1][l],dp[i][l]); REP(k,10){ chmax(dp[i+1][(l+k)%10],(tes[k] != 0 ? dp[i][l] + tes[k] : -500000000000)); } } } cout << dp[10][0] << "\n"; }