Count Strictly Greater Indices

You are given two sequences A and B each containing N integers. Your task is to count the number of indices \(i\) (with \(0 \le i < N\)) for which the element in sequence A is strictly greater than the corresponding element in sequence B, i.e. \(A_i > B_i\).

Input Format:

• The first line contains an integer \(N\), representing the length of both sequences.
• The second line contains \(N\) space-separated integers, representing the sequence \(A\).
• The third line contains \(N\) space-separated integers, representing the sequence \(B\).

Output Format:

• Output a single integer representing the count.

Example:

Input:
4
5 1 7 3
2 9 5 3
Output:
2

</p>

inputFormat

The input is read from standard input and consists of three lines:

• The first line contains a single integer \(N\) denoting the size of the arrays.
• The second line consists of \(N\) integers representing the array \(A\).
• The third line consists of \(N\) integers representing the array \(B\).

outputFormat

Output a single integer which is the number of indices \(i\) such that \(A_i > B_i\).

## sample

4
5 1 7 3
2 9 5 3

2

</p>