Results Table

Time limit2sMemory limit1024 MB

Summary

Count the rows of a results table that contain at least one '+' character, which marks a solved problem.

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

Statement

Ralph and Vanellope, while travelling through games, accidentally ended up on the computer of a programming olympiad participant. The participant was given $n$ problems, and each problem could be submitted at most $m$ times.

The results table has $n$ rows and $m$ columns. The cell in row $i$ and column $j$ contains one of the following characters:

+: the $j$ -th submission for problem $i$ is correct.
-: the $j$ -th submission for problem $i$ is incorrect.
.: problem $i$ has no $j$ -th submission.

Vanellope explained to Ralph that only the first correct submission for each problem counts, and any later submissions do not affect the participant's result. Ralph wondered how many of the given problems the participant solved.

Input

The first line contains two integers $n$ and $m$ , the number of problems and the maximum number of submissions for one problem ( $1 \le n, m \le 100$ ).

Each of the next $n$ lines contains $m$ characters +, -, or ., describing the results table.

It is guaranteed that once a . appears in a row, only . characters follow it.

Output

Print a single integer, the number of problems the participant solved correctly.

Examples2

Example 1
Input
```
4 5
---+.
+....
-----
-+-..
```
Expected output
```
3
```
Example 2
Input
```
1 4
-++-
```
Expected output
```
1
```