#include <bits/stdc++.h>
int main() {
  int c1, c2, n, i, k1 = 0, k2 = 0;
  scanf("%d", &n);
  int a[n];
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int x[n], y[n];
  for (i = 0; i < n; i++) {
    if (a[i] % 2 == 1)
      x[k1++] = a[i];
    else
      y[k2++] = a[i];
  }
  int min;
  min = k1;
  if (k2 < k1) min = k2;
  for (i = 0; i < min; i++) {
    x[k1 - 1 - i] = 0;
    y[k2 - 1 - i] = 0;
  }
  if (k1 > k2) {
    x[k1 - min - 1] = 0;
  } else
    y[k2 - min - 1] = 0;
  int sum1 = 0;
  int sum2 = 0;
  for (i = 0; i < k1; i++) sum1 += x[i];
  for (i = 0; i < k2; i++) sum2 += y[i];
  int ans = sum1 + sum2;
  printf("%d", ans);
}
