#ifdef NOW_PROBLEM  
#define REP(i, n) for(int i = 0; i < (int)(n); i++)

#include "bits/stdc++.h"
using namespace std;

int main() {
	int N;
	cin >> N;
	vector<int> a(N);

	REP(i, N) {
		cin >> a[i];
	}

	int max_mod = 0;
	REP(i, N) {
		max_mod += a[i];
	}
	max_mod -= N;

	cout << max_mod << endl;

	return 0;
}
