#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	int N;
	int size1,size2;
	vector<int> v;
	cin >> N;
	for (int i = 0; i < N;i++) {
		int temp; cin >> temp;
		v.push_back(temp);
	}
	sort(v.begin(), v.end());
	do {
		size1 = size2 = v.size();
		int key = 0;
		do {
			if (key + 1 < size2) {
				if ((v[key + 1] - v[key]) % 2 == 1) {
					v.erase(v.begin() + key);
					v.erase(v.begin() + key);
				}
				else {
					key++;
				}
			}
			size2 = v.size();
		} while (key + 1 < size2);
	} while (size1 != size2 && size2 != 0);
	cout << v.size() << endl;
	return 0;
}