In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of October 26th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #03 exercise sheet]

[AED007] Interval Count

Tom really likes sorted integer sequences and he now needs your help for counting elements.

The Problem

Given a sorted sequence of N integer numbers and Q queries, each one indicating an interval range to search for, your task is to find how many numbers in the sequence are in the queried interval.

Input

The first line of input contains an integer N, the quantity of numbers in the sorted sequence. The second line contains the sequence itself with N space separated integers (we denote each one by S_i). It is guaranteed that these come in increasing order, but there might be repeated numbers.

The third line contains an integer Q, the quantity of queries to consider. Each of the following Q lines contains a query in the form of two integers two integers A_i and B_i, indicating we are considering the interval [A_i, B_i].

Output

The output should contain exactly Q lines. The i-th line should contain amount of numbers in the sequence that are in the interval [A_i, B_i], that is, how many S_j sequence numbers exist such that A_i ≤ S_j ≤ B_i.

Constraints

The following limits are guaranteed in all the test cases that will be given to your program:

10
2 2 2 3 5 5 8 8 8 8
5
1 9
3 5
4 7
6 7
1 1

10
3
2
0
0

Explanation of the example:

• All 10 numbers are in [1,9]
• 3 numbers are in [3,5]
• 2 numbers are in [4,7]
• no number is in [6,7]
• no number is in [1,1]