Democracy

Time limit0.5sMemory limit1024 MB

Summary

Count the candidates that get more than half of the M votes in favor, where each candidate's votes are given as a string of O and X.

Level: Easy2 of 10
Topics: Implementation, String
Solved: No attempts yet

Problem

The monthly Hyangyu gathering decides which problem candidates get used by majority vote. Each of the $N$ candidates is judged by $M$ committee members, and each member votes in favor or against. A candidate that receives a majority of votes in favor is included. $M$ is always odd.

Given the votes of the committee members on each candidate, find the number of problems that will be included.

Input

The first line contains the number of candidates $N$ and the number of committee members $M$ , separated by a space. ( $1 \le N \le 100$ ; $1 \le M \le 99$ ; $M$ is odd)

Each of the next $N$ lines contains a string of length $M$ showing the committee's votes on one candidate. The $i$ -th character is O if the $i$ -th member votes in favor, and X otherwise.

Output

Print the number of problems that will be included.

Examples3

Example 1
Input
```
2 3
OOX
OXX
```
Expected output
```
1
```
Example 2
Input
```
3 3
OOX
OOX
OOX
```
Expected output
```
3
```
Example 3
Input
```
3 3
OXO
XXO
OOO
```
Expected output
```
2
```