import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;

public class B {
	static Random random;
	private static void mySort(long[] s) {
        for (int i = 0; i < s.length; ++i) {
            int j = random.nextInt(i + 1);
            long t = s[i];
            s[i] = s[j];
            s[j] = t;
        }
        Arrays.sort(s);
    }
	
	public static void main(String[] args) {
		random = new Random(543534151132L + System.currentTimeMillis());
		Scanner scan=new Scanner(System.in);
		int nb=scan.nextInt();
		int nodd=0;
		int neven=0;
		long tmp;
		long[] oddTmp=new long[nb];
		long[] evenTmp=new long[nb];
		for(int i=0;i<nb;i++) {
			tmp=scan.nextLong();
			if(tmp%2==0)evenTmp[neven++]=tmp;
			else oddTmp[nodd++]=tmp;
		}
		long[] odd=new long[nodd];
		long[] even=new long[neven];
		for(int i=0;i<nodd;i++)odd[i]=oddTmp[i];
		for(int i=0;i<neven;i++)even[i]=evenTmp[i];
		mySort(odd);
		mySort(even);
		long sum=0;
		if(even.length>=odd.length) {
			for(int i=0;i<nb;i++) {
				if(i%2==0) {
					if(neven>0)neven--;
					else break;
				}
				else {
					if(nodd>0)nodd--;
					else break;
				}
			}			
			for(int i=0;i<neven;i++)sum+=even[i];
			for(int i=0;i<nodd;i++)sum+=odd[i];
		}else {
			for(int i=0;i<nb;i++) {
				if(i%2!=0) {
					if(neven>0)neven--;
					else break;
				}
				else {
					if(nodd>0)nodd--;
					else break;
				}
			}
			for(int i=0;i<neven;i++)sum+=even[i];
			for(int i=0;i<nodd;i++)sum+=odd[i];
		}
		
		
		System.out.println(sum);
		scan.close();
	}
}	