#include <bits/stdc++.h>
using namespace std;
int a[100010], tree[300010];
void init(int node, int b, int e) {
  if (b == e) {
    tree[node] = a[b];
    return;
  }
  int left = node * 2;
  int right = node * 2 + 1;
  int mid = (b + e) / 2;
  init(left, b, mid);
  init(right, mid + 1, e);
  tree[node] = tree[left] + tree[right];
}
int query(int node, int b, int e, int i, int j) {
  if (i > e || j < b) return 0;
  if (b >= i && e <= j) return tree[node];
  int left = node * 2;
  int right = node * 2 + 1;
  int mid = (b + e) / 2;
  int p1 = query(left, b, mid, i, j);
  int p2 = query(right, mid + 1, e, i, j);
  return p1 + p2;
}
int main() {
  int n, cnt = 0, i;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  init(1, 0, n - 1);
  for (i = 1; i < n; i++) {
    int p1 = query(1, 0, n - 1, 0, i - 1);
    int p2 = query(1, 0, n - 1, i, n - 1);
    if (p1 == p2) cnt++;
  }
  cout << cnt << endl;
  return 0;
}
