20344번 - Exam 서브태스크다국어

N students are sitting in a row, taking an exam. They are numbered from left to right with integers starting from 1. It is known how good each student’s work is: i-th student is going to score exactly A_i points.

Sometimes the proctor leaves for a break and when that happens students can cheat: any two or more consecutive students can gather and copy the best work among them. As a result, their scores become equal to the maximum score in that interval. Cheating can happen arbitrarily many (possibly zero) times.

In order to pass the exam i-th student needs to score exactly B_i points. Determine the maximum number of students that can pass the exam.

In the first line of the input there is an integer N.

In the next line there are N integers: A₁, A₂, ..., A_N.

In the next line there are N integers: B₁, B₂, …, B_N.

You should print exactly one integer: the maximum number of students.

• 2 ≤ N
• 1 ≤ A_i ≤ 10⁹
• 1 ≤ B_i ≤ 10⁹

In the first example the first two students can cheat after which the scores becomes 2,2,3 and they both pass the exam.

In the second example students 2 and 3 can pass the exam but not both at the same time. Note that this test can’t be present in subtasks 2,3 or 4.