#include <bits/stdc++.h>
long long int arr[2005], temp[2005];
void sort(int l, int r) {
  if (l >= r) return;
  int m = (l + r) / 2;
  int l1 = l, l2 = m + 1, r1 = m, r2 = r, i = l;
  sort(l1, r1);
  sort(l2, r2);
  while (l1 <= r1 || l2 <= r2) {
    if (l1 > r1) {
      temp[i++] = arr[l2++];
    } else if (l2 > r2) {
      temp[i++] = arr[l1++];
    } else if (arr[l1] <= arr[l2]) {
      temp[i++] = arr[l1++];
    } else {
      temp[i++] = arr[l2++];
    }
  }
  for (i = l; i <= r; i++) {
    arr[i] = temp[i];
  }
  return;
}
int main(void) {
  int N, i, cev = 0, cod = 0;
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%lld", &arr[i]);
    if (arr[i] % 2 == 0)
      cev++;
    else
      cod++;
  }
  int f = 0, c;
  long long int sum = 0;
  sort(0, N - 1);
  if (cod > cev) {
    f = 1;
    cod = cod - cev - 1;
  } else
    cod = cev - cod - 1;
  c = 0;
  for (i = 0; i < N; i++) {
    if (arr[i] % 2 == f) {
      if (c < cod) sum += arr[i];
      c++;
    }
  }
  printf("%lld\n", sum);
  return 0;
}
