Beautiful Numbers

Xiaoyang has n positive integers. He considers a positive integer to be a beautiful number if and only if it is a multiple of \(9\) but not a multiple of \(8\). Your task is to count how many beautiful numbers are present among the given integers.

Note: A number \(k\) is considered a multiple of \(m\) if there exists an integer \(t\) such that \(k = t \times m\).

inputFormat

The first line contains an integer \(n\) (1 \(\leq\) n \(\leq\) 10⁵). The second line contains \(n\) positive integers separated by spaces.

outputFormat

Output a single integer representing the count of beautiful numbers.

sample

5
9 8 18 24 81

3