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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            Integer[] ar = new Integer[n];
            ArrayList<Integer> evenNumbers = new ArrayList<>();
            ArrayList<Integer> oddNumbers = new ArrayList<>();
            int numberOfOdd = 0, numberOfEven = 0;
            int totalSum = 0;
            for (int i = 0; i < n; i++) {
                int cur = in.nextInt();
                ar[i] = cur;
                if (cur % 2 == 0) {
                    numberOfEven++;
                    evenNumbers.add(cur);
                } else {
                    numberOfOdd++;
                    oddNumbers.add(cur);
                }
                totalSum += ar[i];
            }
            int ans = 0;
            if (numberOfEven == 0 || numberOfOdd == 0) {
                Arrays.sort(ar);
                for (int i = 0; i < n - 1; i++)
                    ans += ar[i];
            } else {
                Collections.sort(evenNumbers);
                Collections.sort(oddNumbers);
                int min1 = getMinSum(numberOfEven, numberOfOdd, true, totalSum, evenNumbers, oddNumbers);
                int min2 = getMinSum(numberOfEven, numberOfOdd, false, totalSum, evenNumbers, oddNumbers);
                ans = Math.min(min1, min2);
            }
            out.println(ans);
        }

        private static int getMinSum(int numberOfEven, int numberOfOdd, boolean fl, int totalSum,
                                     ArrayList<Integer> evenNumbers, ArrayList<Integer> oddNumbers) {
            int choiceSum = 0;
            int i1 = numberOfEven - 1;
            int i2 = numberOfOdd - 1;
            while (true) {
                if (fl) {
                    if (i1 < 0)
                        break;
                    choiceSum += evenNumbers.get(i1);
                    i1--;
                } else {
                    if (i2 < 0)
                        break;
                    choiceSum += oddNumbers.get(i2);
                    i2--;
                }
                fl = !fl;
            }
            return totalSum - choiceSum;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}

