Problem Statement

Strawberry farmer ecottea has harvested $N$ strawberries. The characteristics of the $i$-th strawberry are represented by $4$ strings $S_{i,1}, S_{i,2}, S_{i,3}, S_{i,4}$. The $i$-th strawberry is an Amaou if and only if these strings contain each of akai, marui, okii, and umai exactly $1$ time, in any order.

Find how many of the $N$ strawberries are Amaou.

Constraints

• $1 \leq N \leq 100$
• $N$ is an integer.
• $S_{i,j}$ is a string of length between $1$ and $5$, inclusive, consisting only of lowercase English letters.

Input

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

$N$
$S_{1,1} \ S_{1,2} \ S_{1,3} \ S_{1,4}$
$\vdots$
$S_{N,1} \ S_{N,2} \ S_{N,3} \ S_{N,4}$

Output

Output the answer. Print a newline at the end.

Sample

4
akai marui okii umai
okii marui umai akai
amai marui oishi umai
umai umai umai umai

2

2
akai marui ookii umai
akai marui oki umai

0