Rust Study

Interview

Time limit1sMemory limit1024 MB

Summary

Count the days on which the pages Im-su actually studied are at least the planned pages for that day.

Level: Easy1 of 10
Topics: Array, Implementation
Solved: No attempts yet

Problem

Im-su became an office worker after finishing job hunting, and bought a book to study the Rust programming language.

After work, Im-su plans to study at least the set number of pages each day.

Given the number of days Im-su planned and studied, the planned pages for each day, and the pages actually studied each day, find the number of days Im-su kept the plan.

Input

The first line contains $N$ , the number of days Im-su planned and studied. $(1 \le N \le 1\,000)$

The second line contains the planned page counts $A_1, A_2, \cdots, A_N$ , separated by spaces. $(1 \le A_i \le 100)$

The third line contains the page counts actually studied $B_1, B_2, \cdots, B_N$ , separated by spaces. $(1 \le B_i \le 100)$

All input values are positive integers.

Output

Print the number of days on which Im-su studied at least the planned number of pages.

Examples1

Example 1
Input
```
5
5 6 7 8 9
5 5 5 10 10
```
Expected output
```
3
```