import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.Arrays;

public class ParityAlternatedDeletionsCodeforces {
	  static class FastReader {
	        BufferedReader br;
	        StringTokenizer st;
	 
	        public FastReader()
	        {
	            br = new BufferedReader(
	                new InputStreamReader(System.in));
	        }
	 
	        String next()
	        {
	            while (st == null || !st.hasMoreElements()) {
	                try {
	                    st = new StringTokenizer(br.readLine());
	                }
	                catch (IOException e) {
	                    e.printStackTrace();
	                }
	            }
	            return st.nextToken();
	        }
	 
	        int nextInt() { return Integer.parseInt(next()); }
	 
	        long nextLong() { return Long.parseLong(next()); }
	 
	        double nextDouble()
	        {
	            return Double.parseDouble(next());
	        }
	 
	        String nextLine()
	        {
	            String str = "";
	            try {
	                str = br.readLine();
	            }
	            catch (IOException e) {
	                e.printStackTrace();
	            }
	            return str;
	        }
	    }
	 

	public static void main(String[] args) {
		FastReader s=new FastReader();
	    int n=s.nextInt();
        
        int a[]=new int[n];
       
        for(int i=0;i<n;++i)
        a[i]=s.nextInt();

         int cnte=0,cnto=0,sum=0;

         for(int i=0;i<n;++i)
         sum +=a[i];

         for(int i=0;i<n;++i){
             if(a[i]%2==0)
             cnte++;
             else
             cnto++;
         }

         if((cnte==cnto) || ((cnte-cnto)==1) ||((cnto-cnte)==1))
         System.out.println(0);

         else{
               Arrays.sort(a);
               int i=n-1;
               int j=n-1;
               if(cnte>cnto){
                int h=cnto+1;
                while(cnto >0){
                  if(a[i]%2!=0){
                    sum -=a[i];
                    cnto--;
                  }
                   
                    i--;
                }
                
                while(h >0){
                    if(a[j]%2==0){
                        sum -=a[j];
                        h--;
                    }
                      
                    j--;
                  }
                  System.out.println(sum);
               }
               else{
                int h=cnte+1;
                while(cnte>0){
                    if(a[i]%2==0){
                        sum -=a[i];
                        cnte--;
                    } 
                       i--;
                  }
                 
                  while(h >0){
                      if(a[j]%2!=0){
                        sum -=a[j];
                        h--;
                      }
                         j--;
                    }
                    System.out.println(sum);
                 }
                 
               }
         }
	}
