#include<bits/stdc++.h>
using namespace std;

int n,a,ans;

int main() {
	cin>>n;
	while(n--) {
		cin>>a;
		ans+=max(0,a-10);
	}
	printf("%d\n",ans);
	return 0;
}

#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
 
#define max(a, b) (a < b? b : a)
#define min(a, b) ((a>b)?b:a)
 
#define MOD 1000000007
 
#define FOR(a,c)   for ( ll (a)=0; (a)<(c); (a)++)
#define FORL(a,b,c)  for ( ll (a)=(b); (a)<(c); (a)++)
#define FORR(a,b,c)  for (  ll (a)=(b); (a)>=(c); (a)--)
 
#define INF 9223372036854775807
//18446744073709551615
#define abs llabs
#define by_AYUSH ios::sync_with_stdio(false);  cin.tie(NULL); cout.tie(NULL);
 
#define no cout<<"NO\n";
#define yes cout<<"YES\n";
 
#define Clear( a, b ) memset( a, b, sizeof( a ) )
#define run if(1)cout<<__LINE__<<endl;  
 
#define pr3(a,b,c) cerr<<#a<<"="<<a<<"\t"<<#b<<"="<<b<<"\t"<<#c<<"="<<c<<"\n";
#define pr2(a,b) cerr<<#a<<"="<<a<<"\t"<<#b<<"="<<b<<"\n";
#define pr1(a) cerr<<#a<<"="<<a<<"\n";
#define debug(x)       cerr<< #x <<" : "<< x << endl;
#define debuga(A,N)    cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p)      cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v)      cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v)     cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m)      cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m)      cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
typedef unsigned long long ull;
typedef long long int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
inline long long  max3(long long  a, long long  b,long long  c){return (a)>(b)?((a)>(c)?(a):(c)):((b)>(c)?(b):(c));}
inline long long  min3(long long  a, long long b,long long c){return (a)<(b)?((a)<(c)?(a):(c)):((b)<(c)?(b):(c));} 
#define F first
#define S second
#define PB push_back
#define POB pop_back
#define MP make_pair
void solve()
{
  int n;cin>>n;
  int s=0;
  int a[n];
  for(int i=0;i<n;i++)
  {
    cin>>a[i];
    if(a[i]>=10)
      s+=a[i]-10;
}
  cout<<s;
}
int main()
{
    //int t;cin>>t;
   // while(t--)
   // {
    solve(); 
     //  }
   return 0;
}
         












 
//                               █████╗ ██╗   ██╗██╗   ██╗███████╗██╗  ██╗
//                              ██╔══██╗╚██╗ ██╔╝██║   ██║██╔════╝██║  ██║
//                              ███████║ ╚████╔╝ ██║   ██║███████╗███████║
//                              ██╔══██║  ╚██╔╝  ██║   ██║╚════██║██╔══██║
//                              ██║  ██║   ██║   ╚██████╔╝███████║██║  ██║
//                              ╚═╝  ╚═╝   ╚═╝    ╚═════╝ ╚══════╝╚═╝  ╚═╝

//                    
//                            
//                       
//                     
//                    



