#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <deque>

using namespace std;

#define rep(i,n) for(int i=0;i<n;++i)
#define Rep(i,n) for(int i=1;i<=n;++i)
#define rrep(i,n) for(int i=n-1;0<=i;--i)
#define rRep(i,n) for(int i=n;0<i;--i)
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define scani(a) scanf("%d",&a)
#define scanr(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define printi(a) printf("%d",a)
#define printr(a) printf("%lf",a)
#define prints(s) printf("%s",s)
#define is_odd(n) (n&1)
#define is_even(n) ((n+1)&1)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
#define all(x) x.begin(), x.end()
#define EPS 1e-9
#define INF 1e9

typedef long long ll;
typedef double Real;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef pair<int,int> pii;

// vars
int N;
vi X;

void solve()
{
  int ans = 0;
  rep(i, N)
  {
    if(is_odd(X[i])) ++ans;
    else --ans;
  }

  printi(abs(ans));
  puts("");
}

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

  // receive
  scani(N);
  X.resize(N);
  rep(i,N) scani(X[i]);

  solve();

  return 0;
}