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
n = int(input())

A = list(map(int, input().split()))


A.sort()

nodds = 0
nevens = 0
for i in range(len(A)):
  p1 = A[i] % 2
  if p1 == 1:
    nodds = nodds + 1
  if p1 == 0:
    nevens = nevens + 1

if nodds > nevens:
  startparity = 1
  nextparity = 0
  nodds -= 1
else:
  startparity = 0
  nextparity = 1
  nevens -= 1

# print(nodds, nevens)

for i in range(len(A)-1, -1, -1):
  if A[i] % 2 == startparity:
    A[i] = -1
    break

# print(nodds, nevens)

while (nextparity == 1 and nodds > 0) or \
      (nextparity == 0 and nevens > 0):
  # print(nodds,nev ens)
  for i in range(len(A)-1, -1, -1):
    if A[i] != -1 and A[i] % 2 == nextparity:
      A[i] = -1
      if nextparity == 1: nodds -= 1
      else: nevens -= 1
      nextparity = 1 - nextparity
      break

s = 0
for a in A:
  if a != -1: s += a

# print(A)
print(s)