#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

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

  int n;
  cin >> n;

  bool flag[500000];
  vi x(n);
  rep(i,0,n) cin >> x[i];

  rep(i,0,n) flag[i] = false;
  int ans = n;
  rep(i,0,n) {
    if(flag[i]) continue;
    rep(j,0,n) {
      if(flag[j] || i== j) continue;
      else if(abs(x[i]-x[j]) % 2 == 1) {
        flag[i] = flag[j] = true;
        ans-=2;
        break;
      }
    }
  }

  cout << ans << endl;

	return 0;
}