#include using namespace std; using ll = long long; using vi = vector; using vl = vector; using pi = pair; using pl = pair; const char alphabetl[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'}; const char alphabetu[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'}; const ll MOD = (ll) 1e9 + 7; const int MAX_INT = 1 << 17; const ll INFL = 1LL << 60; const ll MAX_V = 1010; const ll MAX_E = 2010; ll V, E; struct edge { ll from, to, cost; }; edge ES[MAX_E]; ll d[MAX_V]; #define ALL(obj) (obj).begin(),(obj).end() #define RALL(obj) (obj).rbegin(),(obj).rend() #define PRINT(n) cout << n << "\n"; #define PRINT2(n, m) cout << n << " " << m << " "<< "\n"; #define REP(i,n) for(int i=0;i<(int)n;++i) #define RREP(i,n) for(int i =(int)n;i>0;--i) #define rep(i,a,b) for(int i=a;i<=b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define FOR(i,a,b) for(int i=a; i<(int)b; ++i) #define RFOR(i,a,b) for(int i=a; i>(int)b; --i) #define REPbit(bit, n) for(int bit = 0; bit < (int)(1< auto sum(Args... args) { return (args + ...); } void no369(){ int N,V,ans; vi a(N); cin >> N; REP(i,N) cin >> a[i]; cin >> V; int sum = accumulate(a.begin(), a.end(), 0); ans = sum - V; PRINT(ans) }