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
"""def append(s):
    arr = list(s)
    if arr[-1] == 'z':
        arr[-1] = 'a'
        i = -2
        while -1 * i <= len(s) and arr[i] == 'z'  :
            arr[i] = 'a'
            i = i - 1
        if -1 * i > len(s):
            arr= ['a'] + arr
        else:
            arr[i] = d[arr[i]]
    else:
        arr[-1] = d[arr[-1]]
    return ''.join(arr)

k = int(input())
s = input()
t = input()

import string
alph = list(string.ascii_lowercase)
alphb = alph[1:] + [alph[0]]
d = dict(zip(alph, range(26)))
print(d)
l = [s]
el = s

while el != t:
    el = append(el)
    l.append(el)

print(l)
middleIndex = (len(l) - 1)/2
print(l[int(middleIndex)])"""


n = int(input())
arr = input().split()
arr = [int(x) for x in arr]

chet_arr = []
nechet_arr = []
for x in arr:
    if x % 2 == 0:
        chet_arr.append(x)
    else:
        nechet_arr.append(x)

if abs(len(chet_arr) - len(nechet_arr)) < 2:
    print(0)
else:
    r = len(nechet_arr) - len(chet_arr)
    if r > 0:
        nechet_arr.sort()
        print(sum(nechet_arr[0:r-1]))
    else:
        r = -1 * r
        chet_arr.sort()
        print(sum(chet_arr[0:r-1]))




    
