Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even?

Input

The first line contains the only integer n (1 ≤ n ≤ 100) — the number of cookie bags Anna and Maria have. The second line contains n integers ai (1 ≤ ai ≤ 100) — the number of cookies in the i-th bag.

Output

Print in the only line the only number — the sought number of ways. If there are no such ways print 0.

Examples

Input

1
1


Output

1


Input

10
1 2 2 3 4 4 4 2 2 2


Output

8


Input

11
2 2 2 2 2 2 2 2 2 2 99


Output

1

Note

In the first sample Olga should take the only bag so that the twins ended up with the even number of cookies.

In the second sample Olga can take any of five bags with two cookies or any of three bags with four cookies — 5 + 3 = 8 ways in total.

In the third sample, no matter which bag with two cookies Olga chooses, the twins are left with 2 * 9 + 99 = 117 cookies. Thus, Olga has only one option: to take the bag with 99 cookies.
	import java.io.*;
	import java.math.*;
	import java.util.*;
	
	/**
	 *
	 * @author Saju
	 *
	 */
	
	public class Main {
	
		private static int dx[] = { 1, 0, -1, 0 };
		private static int dy[] = { 0, -1, 0, 1 };
	
		private static final long INF = Long.MAX_VALUE;
		private static final int INT_INF = Integer.MAX_VALUE;
		private static final long NEG_INF = Long.MIN_VALUE;
		private static final int NEG_INT_INF = Integer.MIN_VALUE;
		private static final double EPSILON = 1e-10;
	
		private static final int MAX = 200007;
		private static final long MOD = 1000000007;
	
		private static final int MAXN = 100007;
		private static final int MAXA = 10000009;
		private static final int MAXLOG = 22;
		
		public static void main(String[] args) throws IOException {
	
			InputReader in = new InputReader(System.in);
			PrintWriter out = new PrintWriter(System.out);
			
	
	//		InputReader in = new InputReader(new FileInputStream("src/test.in"));
	//		PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("src/test.out")));
			
	
	/*
	
	
	
	*/
			int n = in.nextInt();
			int odd = 0;
			int even = 0;
			
			for(int i = 0; i < n; i++) {
				int a = in.nextInt();
				if(a % 2 == 0) {
					even++;
				}
				else {
					odd++;
				}
			}
			
			if(odd % 2 == 1) {
				out.println(odd);
			}
			else {
				out.println(even);
			}
			
			out.flush();
			out.close();
			System.exit(0);
		}
		
		
	
		private static class Point{
			double x;
			double y;
			Point(double x, double y){
				this.x = x;
				this.y = y;
			}
			double getDistance(Point p2) {
				Point p1 =  this;
				double dx = p1.x - p2.x;
				double dy = p1.y - p2.y;
				
				return Math.sqrt((dx * dx) + (dy * dy));
			}
		}
		
		
		private static int abs(int x) {
			if(x < 0) {
				return -x;
			}
			return x;
		}
		
		private static int lcm(int a, int b) {
			return (a * b) / gcd(a, b);
		}
	
		private static int gcd(int a, int b) {
			if (a == 0)
				return b;
			return gcd(b % a, a);
		}
		
		private static int log(long x, int base) {
			return (int) (Math.log(x) / Math.log(base));
		}
		
		private static long min(long a, long b) {
			if(a < b) {
				return a;
			}
			return b;
		}
		
		private static int min(int a, int b) {
			if(a < b) {
				return a;
			}
			return b;
		}
		
		private static long max(long a, long b) {
			if(a < b) {
				return b;
			}
			return a;
		}
		
		private static int max(int a, int b) {
			if(a < b) {
				return b;
			}
			return a;
		}
		
		private static class InputReader {
			public BufferedReader reader;
			public StringTokenizer tokenizer;
	
			public InputReader(InputStream stream) {
				reader = new BufferedReader(new InputStreamReader(stream));
				tokenizer = null;
			}
	
			public String next() {
				try {
					while (tokenizer == null || !tokenizer.hasMoreTokens()) {
						tokenizer = new StringTokenizer(reader.readLine());
	
					}
				} catch (IOException e) {
					return null;
				}
				return tokenizer.nextToken();
			}
	
			public String nextLine() {
				String line = null;
				try {
					tokenizer = null;
					line = reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return line;
			}
	
			public int nextInt() {
				return Integer.parseInt(next());
			}
	
			public double nextDouble() {
				return Double.parseDouble(next());
			}
	
			public long nextLong() {
				return Long.parseLong(next());
			}
	
			public boolean hasNext() {
				try {
					while (tokenizer == null || !tokenizer.hasMoreTokens()) {
						tokenizer = new StringTokenizer(reader.readLine());
					}
				} catch (Exception e) {
					return false;
				}
				return true;
			}
		}
	}
	 		    				  		 	 			 	 	 	 	