Call for Problems

Time limit1sMemory limit1024 MB

Summary

Given n difficulty ratings, count how many of them are odd numbers.

Level: Easy1 of 10
Topics: Implementation
Solved: No attempts yet

Problem

The Call for Problems for the ICPC North America Qualifier (NAQ) has finished, and several problems were proposed. The judges voted on the difficulty of each problem. The NAQ does not want to be considered an odd contest, so it refuses to use any problem whose difficulty rating is odd (not divisible by two).

Given the difficulty ratings of the candidate problems, count how many were excluded by this rule.

Input

The first line contains a single integer $n$ ( $1≤n≤50$ ), the number of candidate problems.

Each of the next $n$ lines contains a single integer $d$ ( $0≤d≤100$ ), the difficulty rating of a problem.

Output

Output a single integer, the number of candidate problems excluded by the rule.

Examples1

Example 1
Input
```
2
2
3
```
Expected output
```
1
```