A flower shop has got n bouquets, and the i-th bouquet consists of ai flowers. Vasya, the manager of the shop, decided to make large bouquets from these bouquets. 

Vasya thinks that a bouquet is large if it is made of two or more initial bouquets, and there is a constraint: the total number of flowers in a large bouquet should be odd. Each of the initial bouquets can be a part of at most one large bouquet. If an initial bouquet becomes a part of a large bouquet, all its flowers are included in the large bouquet.

Determine the maximum possible number of large bouquets Vasya can make. 

Input

The first line contains a single positive integer n (1 ≤ n ≤ 105) — the number of initial bouquets.

The second line contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the number of flowers in each of the initial bouquets.

Output

Print the maximum number of large bouquets Vasya can make. 

Examples

Input

5
2 3 4 2 7


Output

2


Input

6
2 2 6 8 6 12


Output

0


Input

3
11 4 10


Output

1

Note

In the first example Vasya can make 2 large bouquets. For example, the first bouquet can contain the first and the fifth initial bouquets (the total number of flowers is then equal to 9), and the second bouquet can consist of the second and the third initial bouquets (the total number of flowers is then equal to 7). The fourth initial bouquet is unused in this scheme. 

In the second example it is not possible to form a single bouquet with odd number of flowers.

In the third example Vasya can make one large bouquet. For example, he can make it using all three initial bouquets. The size of the large bouquet is then equal to 11 + 4 + 10 = 25.
    //    A Computer is Like a mischievous genie.
    //    It will give you exactly what you ask for,
    //    but not always what you want
    //    A code by Rahul Verma


    import java.io.BufferedOutputStream;
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.io.PrintWriter;
    import java.math.BigInteger;
    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.Collections;
    import java.util.Comparator;
    import java.util.HashMap;
    import java.util.HashSet;
    import java.util.LinkedHashSet;
    import java.util.LinkedList;
    import java.util.List;
    import java.util.PriorityQueue;
    import java.util.Queue;
    import java.util.Set;
    import java.util.Stack;
    import java.util.StringTokenizer;
    import java.util.TreeMap;
    import java.util.TreeSet;


    public class Main {


        static class Clock {

            protected long start, stop;

            public void start() {

                start = System.currentTimeMillis();
            }

            public void stop() {
                stop = System.currentTimeMillis();
            }

            public String getTime() {

                return ((stop - start) + " ms");
            }
        }


        public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        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[] nextSArray() {
                String sr[] = null;
                try {
                    sr = br.readLine().trim().split(" ");
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return sr;
            }

            String nextLine() {
                String str = "";
                try {
                    str = br.readLine();
                } catch (IOException e) {
                    e.printStackTrace();
                }

                return str;
            }
        }


        static long powmodulo(long a, long p) {
            if (p == 0) {
                return 1 % mod;
            }
            if (p == 1) {
                return a % mod;
            }
            long ans = 1;
            while (p > 0) {
                if ((p & 1) > 0) {
                    ans = (ans * a) % mod;
                }
                a = (a * a) % mod;
                p = p >> 1;
            }
            return ans % mod;
        }


        static long mod = 1000000007;

        static long gcd(long a, long b) {
            if (a == 0) {
                return b;
            }
            return gcd(b % a, a);
        }

        static long fast_powerNumbers(long a, long n) {
            if (n == 1) {
                return a;
            }
            long ans = fast_powerNumbers(a, n / 2);
            if (n % 2 == 0) {
                return (ans * ans);
            } else {
                return ((ans * ans) * (a));
            }
        }


        static void dfs_helper(int[][] arr, int i, int j, int team, int n, int m) {
            arr[i][j] = team;
            if (i - 1 >= 0 && arr[i - 1][j] == 1) {
                dfs(arr, i - 1, j, team, n, m);
            }
            if (j - 1 >= 0 && arr[i][j - 1] == 1) {
                dfs(arr, i, j - 1, team, n, m);
            }
            if (i + 1 < n && arr[i + 1][j] == 1) {
                dfs(arr, i + 1, j, team, n, m);
            }
            if (j + 1 < m && arr[i][j + 1] == 1) {
                dfs(arr, i, j + 1, team, n, m);
            }

        }

        static void dfs(int[][] arr, int i, int j, int team, int n, int m) {
            dfs_helper(arr, i, j, team, n, m);

        }
        public static int arr[];


        static void seive(int n) {
            // 1 is not prime
            arr = new int[n + 1];
            arr[0] = arr[1] = 1;
            for (int i = 4; i <= n; i = i + 2) {
                arr[i] = 1;
            }
            for (int i = 3; i * i <= n; i = i + 2) {
                if (arr[i] == 0) {
                    for (int j = i * i; j <= n; j = j + i) {
                        arr[j] = 1;
                    }

                }
            }
        }




        public static void main(String[] args) throws Exception {
            FastReader sc = new FastReader();

            Clock clock = new Clock();

            clock.start();
            int n=sc.nextInt();
            int e=0;
            int o=0;
            for (int i = 0; i <n ; i++) {
                int ele=sc.nextInt();
                if((ele&1)==0)
                {
                    ++e;
                }
                else
                    ++o;
            }
            int ans = 0;
            int x=Math.min(e,o);
            ans+=x;
            e-=x;
            o-=x;
            ans+=o/3;

            System.out.println(ans);

        }
    }


    class Pair{

        int a,b;
        Pair(int a,int b)
        {
            this.a=a;
            this.b=b;
        }
    }
    class DSU
    {
        int parent[];
        int rank[];

        long sum[] ;
        DSU(int n)
        {
            this.parent=new int[n];
            this.rank=new int[n];
            sum=new long[n];
            Arrays.fill(parent,-1);
            Arrays.fill(rank,1);

        }

        int find(int s1)
        {
            if(parent[s1]==-1)
                return s1;
            return parent[s1]=find(parent[s1]);
        }

        void unite(int s1,int s2)
        {
            int p1=this.find(s1);
            int p2=this.find(s2);
            if(p1==p2)
                return;
            if(rank[p1]>rank[p2])
            {
                parent[p2]=p1;
                rank[p1]+=rank[p2];
                // System.out.println(arr[p2]);

                sum[p1]+=sum[p2];
                //sum[p2]+=sum[p1];

            }
            else
            {
                parent[p1]=p2;
                rank[p2]+=rank[p1];
                //System.out.println(arr[p1]);
                sum[p2]+=sum[p1];
                //sum[p1]+=sum[p2];
            }
        }


    }

    class Gaph {

        HashMap<Integer, ArrayList<Integer>> hm;

        Gaph() {
            hm = new HashMap<>();
        }

        Gaph(int n) {

            hm = new HashMap<>();
            for (int i = 0; i < n; i++) {
                hm.put(i, new ArrayList<Integer>());
            }
        }

        // function for adding an edge.................................................
        public void addEdge(int a, int b, boolean isDir) {
            if (isDir) {
                if (hm.containsKey(a)) {
                    hm.get(a).add(b);
                } else {
                    hm.put(a, new ArrayList<>(Arrays.asList(b)));
                }
            } else {
                if (hm.containsKey(a)) {
                    hm.get(a).add(b);
                } else if (!hm.containsKey(a)) {
                    hm.put(a, new ArrayList<>(Arrays.asList(b)));
                }

                if (hm.containsKey(b)) {
                    hm.get(b).add(a);
                } else if (!hm.containsKey(b)) {
                    hm.put(b, new ArrayList<>(Arrays.asList(a)));
                }
            }
        }


    }

    // out.println(al.toString().replaceAll("[\\[|\\]|,]",""));