#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(long long i=0;i<(long long)(n);i++) #define REP(i,k,n) for(long long i=k;i<(long long)(n);i++) #define all(a) a.begin(),a.end() #define eb emplace_back #define lb(v,k) (lower_bound(all(v),k)-v.begin()) #define ub(v,k) (upper_bound(all(v),k)-v.begin()) #define fi first #define se second #define pi M_PI #define PQ(T) priority_queue #define SPQ(T) priority_queue,greater> using ll=long long; using P=pair; using PP=tuple; using S=multiset; using vi=vector; using vvi=vector; using vvvi=vector; const ll inf=1001001001001001; const int INF=1001001001; const int mod=1000000007; const double eps=1e-10; template bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} template bool chmax(T&a,T b){if(a void out(T a){cout< void outp(T a){cout<<'('< void outvp(T v){rep(i,v.size())cout<<'('< void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout< void outvv(T v){rep(i,v.size())outv(v[i]);} template bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);} template void YesNo(T b){if(b)out("Yes");else out("No");} void decimal(int x){cout<0){res.eb(x%10);x/=10;}reverse(all(res));return res;} void solve(){ int n; cin>>n; vi a(n); rep(i,n) cin>>a[i]; vvi dp(n+1,vi(10,-1)); dp[0][0]=0; rep(i,n){ rep(p,10){ dp[i+1][p]=dp[i][p]; if(dp[i][(p+10-a[i])%10]>=0){ chmax(dp[i+1][p],dp[i][(p+10-a[i])%10]+1); } } } out(dp[n][0]); //outvv(dp); } signed main(){ cin.tie(0); ios::sync_with_stdio(false); solve(); }