#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)      //iをaからn
#define per(i, n, a) for (int i = a - 1; i >= n; i--) //iをaからn
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F first
#define S second
//sort(all(a)); ソート
//sort(all(a),greater<int>()); 逆順ソート
//a.erase(unique(all(a)), a.end()); ソート後に重複を削除
typedef long long ll;
//const ll mod=1000000007;

int main(){
    int n;
    cin>>n;
    int sumsum=0;
    int a;
    int nn=n-1;
    while(nn--){
        cin>>a;
        sumsum+=a;
    }
    int ans=0;
    rep(i,0,101){
    if((sumsum+i)%n==0)ans++;
    }
    cout<<ans<<endl;
    return 0;
}