#include <bits/stdc++.h>
#define For(i, a, b) for(long long i = a; i < b; i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(long long i = a; i >= b; i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
using namespace std;

using lint = long long;
using ld = long double;

int INF = 2000000000;
lint LINF = 1000000000000000000;

int main() {
    int n;
    cin >> n;
    vector<int> x(n);
    rep(i, n) {
        cin >> x[i];
    }
    sort(ALL(x));
    rep(i, n) {
        x[i] = abs(x[i]) % 2;
    }
    auto f = [&]() -> int {
        stack<int> st;
        rep(i, n) {
            if (st.empty() || (!st.empty() && st.top() == x[i])) {
                st.emplace(x[i]);
            } else {
                st.pop();
            }
        }
        return st.size();
    };
    int ans = INF;
    ans = min(ans, f());
    reverse(ALL(x));
    ans = min(ans, f());
    cout << ans << endl;
}