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
# -*- coding: utf-8 -*-
import sys
from fractions import gcd
from fractions import gcd
def fi():
    return int(sys.stdin.readline())

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

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

def fo(*args):
    for s in args:
        sys.stdout.write(str(s)+' ')
    sys.stdout.write('\n')
INF=10**9+7
sys.setrecursionlimit(INF)

#main
n=fi()
a=raw_input().split()
a=[int(i) for i in a]
a.sort()
co=0
ce=0
for i in a:
    if i%2==0:
        ce+=1
    else:
        co+=1

if abs(co-ce)<=1:
    fo(0)
elif co>ce:
    d=co-ce-1
    s=0
    count=0
    for i in a:
        if i%2==1:
            s+=i
            count+=1
        if count==d:
            break
    fo(s)

else:
    d=ce-co-1
    s=0
    count=0
    for i in a:
        if i%2==0:
            s+=i
            count+=1
        if count==d:
            break
    fo(s)
    
            
            
            

    


    
    
    
        
        
    
        

    
            
              
    
    
    
    
    
    
    
        
    
    
    


            
    
        
            
                
            
            
 
    


    

    
        
            
            
            
    
    
    
    
    
    


    


    
            
        
    
    
        
        
    
    
    
        
        
        

 




        
        
        
        

 



