Count Palindrome Numbers

Given a list of numbers, your task is to count how many of them are palindromic.

A number is said to be palindromic if its decimal representation reads the same forward and backward. For example, the number 121 is a palindrome, while 123 is not.

The input will consist of a single list of numbers and you are required to output a single integer representing the count of palindromic numbers.

inputFormat

The input is given via stdin. The first line contains an integer n that indicates the number of elements. The second line contains n space-separated integers.

outputFormat

Output a single integer on stdout which is the count of palindromic numbers in the given list.

4
121 131 33 454

4