#include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589793238460;
const long long mod = 1e9 + 7;
void FAST() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.second);
}
void solve() {
  int n;
  cin >> n;
  vector<int> even, odd, sol;
  for (__typeof(n) i = (0) - (0 > n); i != (n) - (0 > n);
       i += 1 - 2 * (0 > n)) {
    int x;
    cin >> x;
    if (x & 1)
      odd.push_back(x);
    else
      even.push_back(x);
  }
  sort(odd.begin(), odd.end());
  sort(even.begin(), even.end());
  int x = min(even.size(), odd.size());
  while (x--) {
    odd.pop_back();
    even.pop_back();
  }
  if (odd.size() > even.size())
    odd.pop_back();
  else if (odd.size() < even.size())
    even.pop_back();
  int sum = 0;
  for (auto x : even) sum += x;
  for (auto x : odd) sum += x;
  cout << sum << '\n';
}
int main() {
  FAST();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
