#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<set>
#include<map>
 
using namespace std;

#define rep(i,n) for(int (i) = (0); (i) < (n); (i)++)
#define pb push_back 
#define eb emplace_back 
#define all(x) x.begin() , x.end()
#define fi frist
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair <int , int> P;
 
const ll mod = 1000000007;
//const ll mod = 998244353;
const ld pi = 3.14159265358979;

/*
[memo]
v.erase(unique(v.begin(), v.end()), v.end());
*/

ll gcd (ll a , ll b) {
	if (a < b) swap(a , b);
	if (b == 0) return 1;
	if (a % b == 0) return b;
	else return gcd (b , a % b);
}

bool is_prime (ll x) {
	if (x == 1) {
		return false;
	}
	if (x == 2 || x == 3 || x == 5 || x == 7) {
		return true;
	}
	if((x & 1) == 0){
		return false;
	}
	for (ll i = 3; i * i <= x; i += 2) {
		if(x % i == 0)return false;
	}
	return true;
}

vector<int> divisor (ll x) {
	vector<int> ret;
	for (int i = 2; i * i <= x; i++) {
		while (x % i == 0) {
			ret.push_back(i);
			x /= i;
		}
	}
	if (x > 1) {
		ret.push_back(x);
	}
	return ret;
}

ll modpow (ll x , ll p , ll m) {
	ll ret = 1;
	while (p > 0) {
		if(p & 1)ret *= x;
		x *= x;
		x %= m;
		p >>= 1;
	}
	return ret;
}

void chmax(ll &a , ll &b) {
	if(a < b)a = b;
}

void chmim (ll &a , ll &b) {
	if(a > b)a = b;
}

//vector<string> ans;
void solve() {
	int n;
	cin >> n;
	int a;
	ll sum = 0;
	rep(i,n - 1){
		cin >> a;
		sum += a;
	}
	int ans = 0;
	rep(i,101){
		if((sum + i) % n == 0)ans++;
	}
	cout << ans << endl;
}


int main() {	
	cin.tie(0);
	ios::sync_with_stdio(false);
	//cout << fixed << setprecision(15);
	solve();
	return 0;
}