#include <bits/stdc++.h>
using namespace std;
void init() {
  ios::sync_with_stdio(0);
  cin.tie(0);
}
void solve();
int main() {
  init();
  solve();
  return 0;
}
bool isprime(long long n) {
  for (long long i = 2; i < sqrt(n) + 1 && i < n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
void solve() {
  int n;
  cin >> n;
  vector<long long> odd;
  vector<long long> even;
  long long in;
  for (int i = 0; i < n; i++) {
    cin >> in;
    (in % 2 == 0) ? even.push_back(in) : odd.push_back(in);
  }
  if (!even.empty()) sort(even.begin(), even.end());
  if (!odd.empty()) sort(odd.begin(), odd.end());
  int countodd;
  int counteven;
  (!odd.empty()) ? countodd = odd.size() : countodd = 0;
  (!even.empty()) ? counteven = even.size() : counteven = 0;
  long long suma = 0;
  long long sumb = 0;
  if (countodd - counteven > 1) {
    for (int i = 0; i < countodd - counteven - 1; i++) {
      suma += odd[i];
    }
  }
  if (counteven - countodd > 1) {
    for (int i = 0; i < counteven - countodd - 1; i++) {
      sumb += even[i];
    }
  }
  cout << max(suma, sumb) << "\n";
}
