#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
//#include "util.h"

using namespace std;
typedef long long lint;
typedef pair<lint, lint> Pii;

#define PI 3.14159265358979323846
#define EPS 1e-6

int main()
{
	int N;
	cin >> N;
	vector<int> X(N);
	for (int i = 0; i < N; i++)	cin >> X[i];

	sort(X.begin(), X.end());

	stack<int> st;
	for (int i = 0; i < N; i++) {
		if (st.empty()) {
			st.push(X[i]);
			continue;
		}
		if ((st.top() + X[i]) & 1)
			st.pop();
		else
			st.push(X[i]);
	}

	cout << st.size() << endl;

	return 0;
}