import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        FastScanner scanner = new FastScanner();
        int n = scanner.nextInt();
        Integer[] nums = new Integer[n];
        for (int i = 0; i < nums.length; i++) {
            nums[i] = scanner.nextInt();
        }
        Arrays.sort(nums, (i1, i2)-> Integer.compare(i2, i1));
        long minSum = Math.min(solve(nums, true), solve(nums, false));
        System.out.println(minSum);

    }

    private static long solve(Integer[] numsO, boolean firstEvent) {

        Integer[] nums = new Integer[numsO.length];
        System.arraycopy(numsO, 0, nums, 0, nums.length);
        int firstIndx = searchFirst(nums, firstEvent);
        if(firstIndx == -1){
            firstIndx = 0;
        }

        boolean prevEven = (nums[firstIndx] & 1) == 0;
        nums[firstIndx] = -1;

        for (int i = 0; i < nums.length; i++) {
            if (prevEven){
                for (int j = 0; j < nums.length; j++) {
                    Integer cur = nums[j];
                    if(cur != -1 && (cur & 1) == 1){
                        prevEven = false;
                        nums[j] = -1;
                        break;
                    }
                }
            }else{
                for (int j = 0; j < nums.length; j++) {
                    Integer cur = nums[j];
                    if(cur != -1 && (cur & 1) == 0){
                        prevEven = true;
                        nums[j] = -1;
                        break;
                    }
                }
            }
        }

        return Arrays.stream(nums).filter(i -> i >= 0).mapToLong(i->i).sum();
    }

    private static int searchFirst(Integer[] nums, boolean firstEvent) {
        for (int i = 0; i < nums.length; i++) {
            if (firstEvent){
                if((nums[i] & 1) == 0){
                    return i;
                }
                continue;
            }
            if((nums[i] & 1) == 1){
                return i;
            }

        }
        return -1;
    }

    static class FastScanner {
        StringTokenizer tok = new StringTokenizer("");
        BufferedReader in;

        public FastScanner() {
            in = new BufferedReader(new InputStreamReader(System.in));
        }

        public String next() throws IOException {
            while (!tok.hasMoreElements())
                tok = new StringTokenizer(in.readLine());
            return tok.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}
