You are a software engineer at Google, and you have been tasked with writing a program that recognizes faces.

You will be given $N$ strings. Output how many of them are exactly face.

Constraints

$1\le N\le {10}^5$

Each string is at least $1$ and at most $100$ characters long.

Input Specification

The first line contains a single integer, $N$.

The next $N$ lines each contain a string of lowercase letters.

Output Specification

Output a single line containing an integer, the number of faces.

Sample Input

6
desk
person
face
thefiveboxingwizardsjumpquickly
facet
face

Sample Output

2