#include <bits/stdc++.h>
using namespace std;
#define FI freopen("../in", "r", stdin)
#define FO freopen("../out", "w", stdout)
#define X first
#define Y second
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef EDBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int, int> ii;

void solve() {
  int n;
  cin >> n;
  int ans = 0;
  while (n --) {
    int x;
    cin >> x;
    ans += max(0, x - 10);
  }
  cout << ans;
}

int main() {
  ios::sync_with_stdio(false);
#ifndef EDBUG
  cin.tie(nullptr);
#endif
#ifdef QUICKRUN
  FI;
    // FO;
#endif

  solve();
  return 0;
}

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#define MOD 1000000007

#include <cctype>
#include <cstring>
#include <cstdio>

using namespace std;
int main() {
    int a,b,c;
    char d;
    string e,f;
    cin >>a;
    if (a>=0){
        cout <<a;
    }
    else cout <<0;

  return 0;
}
