#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> v(n);
  rep(i, 0, n) cin >> v[i];
  sort(v.begin(), v.end());

  stack<int> st;
  rep(i, 0, n) {
    if (st.empty()) {
      st.push(v[i]);
      continue;
    }

    int t = st.top();
    int abs_tt = abs(t % 2), abs_vv = abs(v[i]);
    if ((abs_tt == 1 && abs_vv % 2 == 0) ||
        (abs_tt % 2 == 0 && abs_vv % 2 == 1)) {
      st.pop();
    } else {
      st.push(v[i]);
    }
  }

  if (st.empty())
    cout << 0 << endl;
  else
    cout << st.size() << endl;
}