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);
    }
}
