#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int num[maxn];
long long tempsum[maxn];
bool judge(long long n) {
  if (floor(sqrt(n)) * floor(sqrt(n)) == n) return true;
  return false;
}
int main() {
  int n, resu;
  while (cin >> n) {
    resu = 0;
    for (int i = 1; i <= n; i++) cin >> num[i];
    tempsum[1] = num[1];
    for (int i = 2; i <= n; i++) {
      tempsum[i] = tempsum[i - 1] + num[i];
    }
    for (int i = 1; i <= n - 1; i++)
      if (tempsum[i] == tempsum[n] - tempsum[i]) {
        resu++;
      }
    cout << resu << endl;
  }
  return 0;
}
