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
# ///==========Libraries, Constants and Functions=============///
#mk_Raghav
import sys

inf = float("inf")
mod = 1000000007


def get_array(): return list(map(int, sys.stdin.readline().split()))


def get_ints(): return map(int, sys.stdin.readline().split())


def input(): return sys.stdin.readline()

def int1():return int(input())

import string

import math
# ///==========MAIN=============///


def main():
    n=int1()
    a=get_array()
    x=0
    y=0
    l1=[]
    l2=[]
    for i in a:
        if i%2==0:
            l1.append(i)
            x=x+1
        else:
            l2.append(i)
            y=y+1
    k1=len(l1)
    k2=len(l2)
    l1.sort()
    l2.sort()
    z=1
    if x>y:
        while z<=k2*2+1:
            if z%2!=0:
                l1.pop()
                x=x-1
            else:
                l2.pop()
                y=y-1
            z=z+1

    z=0
    if y>x:
        while z<k1*2+1:
            if z%2!=0 and len(l1)>0:
                l1.pop()
                x=x-1
            elif z%2==0 and len(l2)>0:
                l2.pop()
                y=y-1
            z=z+1



    if (len(l1)==0 and len(l2)==0) or k1==k2:
        print(0)

    else:
        print(sum(l1)+sum(l2))





if __name__ == "__main__":
    main()
