#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>  //external policy based dsa accociate container 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds;
using namespace std;

#define fbo                   find_by_order  // return pointer to kth element
#define ook                   order_of_key   // return number of element strictly less than a given value
#define ff                    first
#define ss                    second
#define int                   long long int
#define pb                    push_back
#define mp                    make_pair
#define pii                   pair<int,int>
#define vi                    vector<int>
#define mii                   map<int,int>
#define pqb                   priority_queue<int>
#define pqs                   priority_queue<int,vi,greater<int> >

#define setbits(x)            __builtin_popcountll(x)
#define zrobits(x)            __builtin_ctzll(x)

#define max_ull               18446744073709551615
#define max_ll                9223372036854775807
#define eps                   1e-10
#define mod                   1000000007
#define inf                   1e18

#define ps(x,y)               fixed<<setprecision(y)<<x
#define mk(arr,n,type)        type *arr=new type[n];

#define w(x)                  int x; cin>>x; while(x--)

//#define rep(a,b,c)            for(i=a;i<=b;i+=c)
#define min3(a, b, c)         min(a, min(b, c))
#define max3(a, b, c)         max(a, max(b, c))
#define min4(a, b, c, d)      min(min(a, b), min(c, d))
#define max4(a, b, c, d)      max(max(a, b), max(c, d))
#define max5(a, b, c, d, e)   max(max3(a, b, c), max(d, e))
#define min5(a, b, c, d, e)   min(min3(a, b, c), min(d, e))

#define lead_zero(x)          __builtin_clzll(x)
#define trail_zero(x)         __builtin_ctz(x)
#define total_1s(x)           __builtin_popcount(x)
#define first_1(x)            __builtin_ffs(x)
#define log2_(x)              __builtin_clz(1) - __builtin_clz(x)

#define isLeap(x)             ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define set(N, cur)           N = (N | (1 << cur))
#define reset(N, cur)         N = (N & (~(1 << cur)))
#define check(N, cur)         ((N & (1 << cur)) == 0)

mt19937                       rng(chrono::steady_clock::now().time_since_epoch().count());

typedef unsigned long long    ull;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;

/* Direction arrays */
/* int dx[] = {1,-1,0,0}, dy[] = {0,0,1,-1}; */                        // 4 Direction
/* int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; */   // 8 Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; */ // Knight Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */            // Hexagonal Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */            // Hexagonal Direction
/* int day[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; */

void c_p_c()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input1.txt", "r", stdin);
    freopen("output1.txt", "w", stdout);
#endif
}
// int powe(int n,int k,int mod1)
// {
//     int res=1;
//     while(k!=0)
//     {
//         if(k&1)
//             res=(res*n)%mod1;
//         k=k/2;
//         n=(n*n)%mod1;
//     }
//     return res;
// }
// int seive[100005];
// void me()
// {
    
//     int n=100005;
//     for(int i=0;i<n;i++)
//     {
//         seive[i]=1;
//     }
//     seive[0]=0;
//     seive[1]=0;
//     for(int i=2;i*i<=n;i++)
//     {
//         if(seive[i]==1)
//         {
//             for(int j=i*i;j<=n;j+=i)
//                 seive[j]=0;
//         }
//     }
// }
main()
{
  c_p_c();
  int n,a,b;
  cin>>n>>a>>b;
  int ans=(n-a)+b;
  cout<<ans<<endl;
}
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)

int n ;
int A[1007] ;

int main(){
    cin >> n ;
    rep(i,n) cin >> A[i] ;
    int sum = 0 ;
    rep(i,n){
        if(A[i] > 10) sum += A[i] - 10 ;
    }
    cout << sum << endl ;
}