Problem A
Phone Book
William is looking for a pizza restaurant in his phone book. He maintains that any pizza place, to be approved, has to be based in Italy. For this reason William is looking for Italian phone numbers. He decided to consider only phone numbers that have +39 as the country code, and that have between 9 and 10 digits (excluding the country code).
Help William count how many pizza restaurants can his phone book contain at the most!
Input
The first line contains one integer: $N$, the number of phone numbers in William’s phone book.
Each of the next $N$ lines contain one phone number $P_ i$.
Output
You need to write a single line containing a single integer: the answer to the problem.
Constraints
-
$1 \le N \le 100\, 000$.
-
Each phone number is between 8 and 15 characters long.
| Sample Input 1 | Sample Output 1 |
|---|---|
6 +493331234567 +393331234567 +4177653664 +39321578345 +1989485948 +3912345 |
2 |
