#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
long long n, ans;
long long d[((int)2e5 + 5)];
long long pre[((int)2e5 + 5)];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> d[i];
  pre[0] = d[0];
  for (int i = 1; i < n; ++i) pre[i] = pre[i - 1] + d[i];
  for (int i = 0; i < n - 1; ++i) {
    if (pre[i] == pre[n - 1] - pre[i]) ans++;
  }
  cout << ans << "\n";
  return 0;
}
