#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
using ll = long long int;
using P = pair<int, int>;

int main(){
    int n;
    cin >> n;
    vector<int> a(n-1);
    for(auto &p: a) cin >> p;
    int sum = 0;
    for(auto &p: a) sum += p;
    int ans = 0;
    for(int i = 0; i <= 100; i++){
        if((sum+i)%n == 0) ans++;
    }
    cout << ans << endl;
    return 0;
}