Orders inside a price range

Problem

A sorted list holds order amounts. For a range low..high (both included) print how many amounts fall inside it.

Input: Line 1: n. Line 2: n amounts in ascending order. Line 3: low and high.
Output: One integer: the count of amounts with low ≤ amount ≤ high.
Constraints: 1 ≤ n ≤ 10^5
0 ≤ amount ≤ 10^9
0 ≤ low ≤ high ≤ 10^9

Example

Input

7
40 120 120 250 400 650 900
120 650

Output

Try the problem first. Open one hint at a time.

Hint 1

Count the amounts that are at most high, then take away those below low.

Hint 2

Use bisect_right for the first count and bisect_left for the second.

Write your Python code, run it on the examples and submit it to hidden tests.