#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
#include <algorithm>
#include <tuple>
#include <vector>
#include <cmath>
#include<set>
#include <sstream>
#include <bitset>
#include <queue>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a)  (a).begin(),(a).end()//配列を全部参照

using namespace std;
using ll = long long int;
using Graph = vector<vector<int>>; // グラフ型
//vector<vector<int>> hako(n, vector<int>(2));
//sort(hako.begin(), hako.end(), [](const vector<int>& alpha, const vector<int>& beta) {return alpha[0] < beta[0]; });

int main() {
	cin.tie(nullptr);
	ll n, m,k;
	string s, t;
	ll ans = 0, sum = 0;
	cin >> n;
	vector<int> hako(n);
	rep(i, n) cin >> hako[i];
	
	rep(i, n) {
		if (hako[i] > 10) {
			ans += hako[i] - 10;
		}
	}



	cout << ans << endl;
	return 0;
}

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

const double PI = acos(-1.0), g = 9.80665;
ll t, tc = 0, i, j, k, n, m, cnt;
bool is;

vector<ll> divisors;
void genDivs(ll n)
{
    for(i=1; i*i<=n; i++) {
        if(n % i == 0) {
            divisors.push_back(i);
            if(i*i != n) divisors.push_back(n/i);
        }
    }
}

void run_cases(void)
{
    tc++;
    cin >> n;
    genDivs(n);
    cnt = 1;
    for(i = 1; i < divisors.size(); i++) {
        if((divisors[i]-1)%2 == 0) cnt++;
    }
    cout << 2*cnt;
}

int main(void)
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    
    // cin >> t;
    t = 1;
    // getchar();
    while(t--) {
        run_cases();
    }    
    return 0;	
}