/**
 *
 * @author Burdyug_Pavel
 */



import java.io.*;
import java.util.StringTokenizer;
import java.util.Scanner;
import java.lang.Math;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
 
 
public class SolverD {
    private static Scanner sc = new Scanner(System.in);
 
    public static void main(String[] args) throws IOException {
        new SolverD().Run();
    }
 
    BufferedReader br;
    PrintWriter pw;
    StringTokenizer stok;
    
    
    
    static int n,k;
    
    class N{
        int a;
        boolean b;
        
        public N(int a, boolean b) {
            this.a = a;
            this.b = b;
        }
    }
    //static String arr[];
 
    private String nextToken() throws IOException {
        while (stok==null || !stok.hasMoreTokens()){
            stok = new StringTokenizer(br.readLine());
        }
        return stok.nextToken();
    }
 
    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
 
    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
 
    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
 
    private void Run() throws IOException {
// comment-uncomment here
//        br=new BufferedReader(new FileReader("input.txt"));
//        pw=new PrintWriter("output.txt");
        br=new BufferedReader(new InputStreamReader(System.in));
        pw=new PrintWriter(new OutputStreamWriter(System.out));
 
        solve();
        pw.flush();
        pw.close();
    }
 
    private void solve() throws IOException {
        n = nextInt();
        
        int arr[] = new int[n];
        List<Integer> l2 = new ArrayList<>();
        List<Integer> l3 = new ArrayList<>();
        int yes = 0;
        int no = 0;
        for (int i = 0;i < arr.length;i++) {
            arr[i] = nextInt();
            if (arr[i] % 2 == 0) {
                yes++;
            } else {
                no++;
            }
        }
        
        Arrays.sort(arr);
        
        
        for (int i = 0;i < n;i++) {
            if (arr[i] % 2 == 0) {
                l2.add(arr[i]);
            } else {
                l3.add(arr[i]);
            }
        }
        int m = Math.abs(yes - no);
        int sum = 0;
        if (yes > no) {
            for (int i = 0;i < m - 1;i++) {
                sum += l2.get(i);
            }
        } else {
            for (int i = 0;i < m - 1;i++) {
                sum += l3.get(i);
            }
        }
        pw.println(sum);
    }
    
    
    
    
    
    
 
 
 
}

