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

public class App {

    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;

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

        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {
        FastReader read = new FastReader();
        PrintWriter printWriter = new PrintWriter(System.out, true);
        int n = read.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = read.nextInt();
        }
        Arrays.sort(arr);
        Stack<Integer> stackOdd = new Stack<>();
        Stack<Integer> stackEven = new Stack<>();
        for (int i = 0; i < n; i++) {
            if (arr[i] % 2 == 0) {
                stackEven.push(arr[i]);
            }
            else
                stackOdd.push(arr[i]);
        }
        boolean nowOdd = true;
        if (stackEven.size() > stackOdd.size())
            stackEven.pop();
        else {
            stackOdd.pop();
            nowOdd = false;
        }

        while ((!nowOdd && stackEven.size() > 0) || (nowOdd && stackOdd.size() > 0)) {
            if (nowOdd)
                stackOdd.pop();
            else
                stackEven.pop();
            nowOdd = !nowOdd;
        }
        long sum = 0;
        if (stackEven.size() > 0) {
            while (stackEven.size() > 0) {
                sum += stackEven.pop();
            }
        } else {
            while (stackOdd.size() > 0) {
                sum += stackOdd.pop();
            }
        }
        printWriter.println(sum);
    }
}
