#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, curr_sum = 0, sum = 0;
  cin >> n;
  std::vector<long long int> square(n), forward(n + 1, 0),
      backward(n + 1, LLONG_MAX);
  for (int i = 0; i < n; i++) cin >> square[i];
  forward[0] = square[0], backward[n - 1] = square[n - 1];
  for (int i = 1; i < n; i++) forward[i] = forward[i - 1] + square[i];
  for (int i = n - 2; i >= 0; i--) backward[i] = backward[i + 1] + square[i];
  long long int result = 0;
  for (int i = 0; i < n; i++) {
    result += (forward[i] == backward[i + 1]);
  }
  cout << result << endl;
  return 0;
}
