Polycarp has an array a consisting of n integers.

He wants to play a game with this array. The game consists of several moves. On the first move he chooses any element and deletes it (after the first move the array contains n-1 elements). For each of the next moves he chooses any element with the only restriction: its parity should differ from the parity of the element deleted on the previous move. In other words, he alternates parities (even-odd-even-odd-... or odd-even-odd-even-...) of the removed elements. Polycarp stops if he can't make a move.

Formally: 

  * If it is the first move, he chooses any element and deletes it; 
  * If it is the second or any next move: 
    * if the last deleted element was odd, Polycarp chooses any even element and deletes it; 
    * if the last deleted element was even, Polycarp chooses any odd element and deletes it. 
  * If after some move Polycarp cannot make a move, the game ends. 



Polycarp's goal is to minimize the sum of non-deleted elements of the array after end of the game. If Polycarp can delete the whole array, then the sum of non-deleted elements is zero.

Help Polycarp find this value.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2000) — the number of elements of a.

The second line of the input contains n integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 10^6), where a_i is the i-th element of a.

Output

Print one integer — the minimum possible sum of non-deleted elements of the array after end of the game.

Examples

Input


5
1 5 7 8 2


Output


0


Input


6
5 1 2 4 6 3


Output


0


Input


2
1000000 1000000


Output


1000000
/**
 *
 * @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);
    }
    
    
    
    
    
    
 
 
 
}

