Count Days with High Production

You are given d days of production details for three types of candies: A, B, and C. For each day, you receive three integers representing the production amounts of candy A, candy B, and candy C, respectively. Your task is to count the number of days in which the production of candy A is strictly greater than the production of both candy B and candy C.

The condition for a day to be counted can be mathematically represented as:

\(A > B \quad \text{and} \quad A > C\)

Read the input from standard input and print the result to standard output.

inputFormat

The first line of input contains a single integer d (\(1 \le d \le 10^5\)), the number of days.

Each of the following d lines contains three space-separated integers representing the production amounts of candy A, B, and C for that day.

outputFormat

Output a single integer, the number of days for which the production of candy A is strictly greater than both candy B and candy C.

## sample

4
15 10 5
8 12 10
20 15 30
25 5 10

2

</p>