#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#define rep(i,n) for (int i=0; i<n; ++i)
#define FOR(i,a,b) for (int i=a; i<b+1; ++i)
#define pb(x) push_back(x)
#define ll long long
using namespace std;

const int inf =1500000000;
int main () {
  int n;
  cin  >> n;
  int x[n];
  rep(i,n) cin >> x[i];
  sort(x, x + n);
  int serials = 1, cnt = n;
  FOR(i,1,n - 1) {
    if (x[i - 1] +1== x[i]) {
        serials++;
        x[i - 1] = inf;
    } else {
       cnt -= serials - serials % 2;
       serials = 1;
       x[i - i%2] = inf;
    }
  }
  bool r[2] ={false, false};
  rep(i,n) {
    if(x[i] == inf) continue;
    int tmp = x[i] %2;
    if(r[(tmp+1)%2]) {
      cnt -=2;
      r[0] = false;
      r[1] = false;
    } else {
      r[tmp] = true;
    }
  }
  
  cout << cnt << endl;
  return 0;
}