#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
#define rep(i,n) for(i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

typedef pair<int,int> P;

int n;

int main(){
    int i,j;
    scanf("%d",&n);
    vector<int> a(n);
    vector<P> rle;
    P l,r;
    rep(i,n)scanf("%d",&a[i]);
    sort(a.begin(),a.end());
    rep(i,n)a[i]=abs(a[i])%2;
    i=0;
    while(i<n){
        rle.push_back(P(a[i],1));
        i++;
        while(i<n&&a[i]==rle[rle.size()-1].first){
            rle[rle.size()-1].second++;
            i++;
        }
    }
    //rep(i,rle.size())printf("(%d,%d)",rle[i].first,rle[i].second);puts("");
    while(rle.size()>1){
        r=rle.back();rle.pop_back();
        l=rle.back();rle.pop_back();
        if(l.first==r.first)rle.push_back(P(l.first,l.second+r.second));
        else{
            if(l.second>r.second)swap(l,r);
            r.second-=l.second;
            n-=l.second*2;
            if(r.second>0)rle.push_back(r);
        }
        //rep(i,rle.size())printf("(%d,%d)",rle[i].first,rle[i].second);puts("");
    }
    printf("%d\n",n);
    return 0;
}