import java.util.*;
public class Parity_Alternated_Deletions
{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n=in.nextInt();
		ArrayList<Integer> even = new ArrayList<Integer>();
		ArrayList<Integer> odd = new ArrayList<Integer>();
		long sum=0,s=0;
		for(int i=0;i<n;i++)
		{
			int a=in.nextInt();
			if(a%2==0)
			{
				even.add(a);
			}
			else
			{
				odd.add(a);
			}
			sum=sum+a;
			s=s+a;
		}
		Collections.sort(even);
		Collections.sort(odd);
		int size_even=even.size();
		int size_odd=odd.size();
        int c=0;
        boolean bool=true;
        while(bool==true)
        {
        	if(c%2==0)
        	{
        	   if(size_even!=0)
        	   {
        		   sum=sum-even.get(size_even-1);
        		   size_even--;
        	   }
        	   else
        	   {
        		   bool=false;
        	   }
        	}
        	else if(c%2!=0)
        	{
        	   if(size_odd!=0)
        	   {
        		   sum=sum-odd.get(size_odd-1);
        		   size_odd--;
        	   }
        	   else
        	   {
        		   bool=false;
        	   }
        	}
        	c++;
        }
        size_even=even.size();size_odd=odd.size();c=1;bool=true;
        while(bool==true)
        {
        	if(c%2==0)
        	{
        	   if(size_even!=0)
        	   {
        		   s=s-even.get(size_even-1);
        		   size_even--;
        	   }
        	   else
        	   {
        		   bool=false;
        	   }
        	}
        	else if(c%2!=0)
        	{
        	   if(size_odd!=0)
        	   {
        		   s=s-odd.get(size_odd-1);
        		   size_odd--;
        	   }
        	   else
        	   {
        		   bool=false;
        	   }
        	}
        	c++;
        }
        System.out.println(Math.min(s, sum));
	}
}
        