#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const double pi = acos(-1.0);
int main() {
  int n, odd = 0, evn = 0;
  cin >> n;
  vector<int> a(n, 0);
  vector<int> e, o;
  for (int i = 0; i < (n); i++) {
    cin >> a[i];
    if (a[i] % 2 == 0) {
      evn++;
      e.push_back(a[i]);
    } else {
      odd++;
      o.push_back(a[i]);
    }
  }
  sort(a.begin(), a.end());
  sort(e.begin(), e.end());
  sort(o.begin(), o.end());
  reverse(a.begin(), a.end());
  if (evn > odd) {
    int s = 0, d = evn - odd;
    if (d == 1) {
      cout << 0;
      return 0;
    }
    for (int i = 0; i < d - 1; i++) {
      s += e[i];
    }
    cout << s;
  } else {
    int s = 0, d = odd - evn;
    if (d == 1) {
      cout << 0;
      return 0;
    }
    for (int i = 0; i < d - 1; i++) {
      s += o[i];
    }
    cout << s;
  }
  return 0;
}
