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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.StringTokenizer;
import java.util.Arrays;

public class Main{

    public static void main(String[] args)throws IOException{
    	br = new BufferedReader(new InputStreamReader(System.in));
    	PrintWriter out = new PrintWriter(System.out);
	int n = nextInt();
	int vp[] = new int[n];
	int vi[] = new int[n];
	Arrays.fill(vp,-1);
	Arrays.fill(vi,-1);
	int x,im = 0, p=0;
	for(int i = 0; i<n;i++){
	    x = nextInt();
	    if(x%2==0){
		vp[p] = x;
		p++;
	    }else{
		vi[im] = x;
		im++;
	    }
	}
	Arrays.sort(vp);
	Arrays.sort(vi);
	if(Math.abs(im-p)==1 || Math.abs(im-p)==0){
	    out.println(0);
	}else{
	    int res = 0;
	    if(p>im){
		int me = Math.min(p,im)+1;
		for(int i = n-1-me; i>=0;i--){
		    if(vp[i]!=-1){
			res+=vp[i];
		    }else{
			break;
		    }
		}
	    }else{
		int me = Math.min(p,im)+1;
		for(int i = n-1-me; i>=0;i--){
		    if(vi[i]!=-1){
			res+=vi[i];
		    }else{
			break;
		    }
		}
	    }
	    out.println(res);
	}
	out.close();
    }
     
    static BufferedReader br;
    static StringTokenizer st = new StringTokenizer("");
    static String next()throws IOException{
    	while(!st.hasMoreTokens()){
    	    st = new StringTokenizer(br.readLine());
    	}
    	return st.nextToken();
    }
    static int nextInt()throws IOException{
    	return Integer.parseInt(next());
    }
    static long nextLong()throws IOException{
	return Long.parseLong(next());
    }
}
