#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
#define sall "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define sallm "abcdefghijklmnopqrstuvwxyz"
#define bigprime (long long)1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//long long fact(long long n){long long ans=1;for (long long i = 1; i <= n; i++) {ans=ans*i;}return ans;}
int timeTosecond(int h,int m,int s){return h*3600+m*60+s;}
int secondTohour(int s){return s/3600;}
int secondTominutes(int s){return (s%3600)/60;}
int secondTosecond(int s){return (s%3600)%60;}

int main() {
    int n,u;
    std::cin>> n;
    std::vector<int> v(n);
    for (size_t i = 0; i < n; i++) {
        std::cin>> v[i];
    }
    std::cin>> u;
    int ans=0;
    for (size_t i = 0; i < n; i++) {
        ans+=v[i];
    }

    std::cout<<ans-u<<"\n";

    
    return 0;
}