#include <bits/stdc++.h>
using namespace std;
int n, num[100005], qzh[100005], fa = 0;
int main() {
  cin >> n;
  cin >> num[0];
  qzh[0] = num[0];
  for (int i = 1; i < n; ++i) {
    cin >> num[i];
    qzh[i] = qzh[i - 1] + num[i];
  }
  for (int i = 0; i < n - 1; ++i) {
    int left = qzh[i];
    int right = qzh[n - 1] - left;
    if (left == right) ++fa;
  }
  cout << fa << endl;
  return 0;
}
