D. World Domination
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In the year 2888, thanks to the teleporters invented by the team "Que No Perdió" in the competition "Cocha Somos Innovación" of the year 2882, Bolivia has conquered the world and Cochabamba is its capital.

Now, for this year's competition, programmers from all over the world will come, but we are interested in knowing how many do not represent any of the 9 original departments from the 21st century, which are:

  • Chuquisaca (ch)
  • La Paz (lp)
  • Cochabamba (cbba)
  • Oruro (or)
  • Potosí (pt)
  • Tarija (tja)
  • Santa Cruz (scz)
  • Beni (be)
  • Pando (pd)

Each team represents a department according to its abbreviation. There may be multiple teams representing the departments. Now, the countries that were annexed to Bolivia count as additional departments. Count how many teams come from what used to be called abroad.

Input

The first line contains an integer $$$n$$$ ($$$3 \leq n \leq 100$$$) representing the number of teams. The following $$$n$$$ lines each contain a character string of minimum length 2 and maximum length 4, representing the abbreviations of the departments, using lowercase letters from the English alphabet.

Output

Print an integer representing the number of teams that represent departments that are not part of the original 9.

Examples
Input
6
arg
cbba
chl
lp
cbba
col
Output
3
Input
3
per
mex
cccp
Output
3