#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6;
long long n, m, x, i, z, cnt, sum, rem, tre, ert, ans, used[N];
vector<long long> v, v1, v2, v3;
vector<pair<string, string> > p;
set<char> second;
string s, s1, s2, s3, s4;
map<string, long long> mp;
char g;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> x;
    v.push_back(x);
    if (x % 2 == 0)
      cnt++;
    else
      ans++;
  }
  x = 0;
  sort(v.begin(), v.end());
  reverse(v.begin(), v.end());
  if (cnt >= ans) {
    for (long long i = 0; i < v.size(); i++) {
      for (long long j = 0; j < v.size(); j++) {
        if (v[j] % 2 == 0 and x == 0 and v[j] != 0) {
          v[j] = 0;
          x = 1;
          break;
        }
        if (v[j] % 2 != 0 and x == 1) {
          v[j] = 0;
          x = 0;
          break;
        }
      }
    }
    for (long long i = 0; i < v.size(); i++) {
      sum += v[i];
    }
    cout << sum;
  }
  if (cnt < ans) {
    for (long long i = 0; i < v.size(); i++) {
      for (long long j = 0; j < v.size(); j++) {
        if (v[j] % 2 == 0 and x == 1 and v[j] != 0) {
          v[j] = 0;
          x = 0;
          break;
        }
        if (v[j] % 2 != 0 and x == 0) {
          v[j] = 0;
          x = 1;
          break;
        }
      }
    }
    for (long long i = 0; i < v.size(); i++) {
      sum += v[i];
    }
    cout << sum;
  }
}
