#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N;
int A[200000];
int dp[101];
int main(){
  int i;
  int j;
  int k;
  int mn;
  int res = 0;
  int sm = 0;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  for(i=(0);i<(N);i++){
    sm += A[i] % 10;
  }
  sm = sm % 10;
  for(i=(1);i<(101);i++){
    dp[i] = 1073709056;
  }
  for(i=(0);i<(N);i++){
    k = A[i] % 10;
    if(k==0){
      continue;
    }
    for(j=(101)-1;j>=(k);j--){
      chmin(dp[j], dp[j-k] + 1);
    }
  }
  mn = 1073709056;
  for(i=(sm);i<(101);i+=(10)){
    chmin(mn, dp[i]);
  }
  wt_L(N - mn);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200916-1

// --- original code ---
// int N, A[2d5];
// int dp[101];
// {
//   int i, j, k, mn;
//   int res = 0, sm = 0;
//   rd(N,A(N));
//   rep(i,N) sm += A[i] % 10;
//   sm = sm % 10;
// 
//   rep(i,1,101) dp[i] = int_inf;
//   rep(i,N){
//     k = A[i] % 10;
//     if(k==0) continue;
//     rrep(j,k,101) dp[j] <?= dp[j-k] + 1;
//   }
//   mn = int_inf;
//   rep(i,sm,101,10) mn <?= dp[i];
//   wt(N - mn);
// }