You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

The Beijing Vehicle Management Office issues a license plate for each registered car. The license plate number consists of six characters, such as $A99452$ or $B88888$. The first character from the left is an uppercase English letter (like $A$, $B$, $C$, etc.), indicating whether the car belongs to the urban area or suburban area of Beijing. The remaining five characters are digits. It is assumed that plates starting with letters $A$, $B$, $C$, $D$, $E$, $F$, $G$, $R$, $S$, $T$ represent urban area cars, while plates starting with other letters represent suburban area cars.
Please help the Vehicle Management Office determine how many of the given license plates belong to suburban cars in Beijing.

Input Format

Line 1 contains a positive integer $N$ ($1 \leq N \leq 10^5$), indicating the number of license plates.
The next $N$ lines each contain a license plate number. It is guaranteed that all given license plates are unique.

Output Format

The number of suburban license plates.

Sample

3
G54672
Q87680
P77771

2