Problem10888--ABC359 - A - Count Takahashi

10888: ABC359 - A - Count Takahashi

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

SubmitSolved: 2Submit Num: 2StatisticsShowOff!

Description

You are given $N$ strings.
The $i$-th string $S_i$ $(1 \leq i \leq N)$ is either Takahashi or Aoki.
How many $i$ are there such that $S_i$ is equal to Takahashi?

Input

The input is given from Standard Input in the following format:

```
$N$
$S_1$
$S_2$
$\vdots$
$S_N$
```

Output

Print the count of $i$ such that $S_i$ is equal to Takahashi as an integer in a single line.

Constraints

  • $1 \leq N \leq 100$
  • $N$ is an integer.
  • Each $S_i$ is Takahashi or Aoki. $(1 \leq i \leq N)$

Sample 1 Input 

3
Aoki
Takahashi
Takahashi

Sample 1 Output 

2
$S_2$ and $S_3$ are equal to Takahashi, while $S_1$ is not.
Therefore, print 2.

Sample 2 Input 

2
Aoki
Aoki

Sample 2 Output 

0
It is possible that no $S_i$ is equal to Takahashi.

Sample 3 Input 

20
Aoki
Takahashi
Takahashi
Aoki
Aoki
Aoki
Aoki
Takahashi
Aoki
Aoki
Aoki
Takahashi
Takahashi
Aoki
Takahashi
Aoki
Aoki
Aoki
Aoki
Takahashi

Sample 3 Output 

7

Source/Category

 
Submit