Palindromic License Plates

You are given a list of license plates represented by integers. A license plate is considered palindromic if the number reads the same backward as forward. Your task is to count the number of palindromic license plates.

Note: A number is palindromic if its decimal representation is the same when reversed. For example, 121 and 454 are palindromic while 123 is not.

The formula for checking a palindrome can be represented in LaTeX as:

\( s = \text{str}(n) \) and \( n \text{ is palindromic if } s = s^R \), where \( s^R \) is the reverse of string \( s \).

inputFormat

The input is read from standard input (stdin) and consists of two lines:

1. The first line contains a single integer \( n \) representing the number of license plates.
2. The second line contains \( n \) integers separated by spaces, each integer representing a license plate number.

outputFormat

Output to standard output (stdout) a single integer representing the count of palindromic license plates.

## sample

5
121 123 454 567 898

3

</p>