#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
using namespace std;

using ll = long long;
const int MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> nums(n);
    int summ = 0;
    for(int i = 0; i < n; i++) {
        cin >> nums[i];
        summ += nums[i];
    }
    int avg = summ / n;

    int l = 0;
    int ans = 0;
    int run_sum = 0;
    for(int i = 0; i < n; i++) {
        if(nums[i] == avg) {
            if(run_sum%avg == 0) {
                ans += i-l-1;
                l = i;
            }
        }
        run_sum += nums[i];

    }
    ans += n-l-2;
    
    cout << ans;
    return 0;
}