Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. Souvenirs

time limit per test

3 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputArtsem is on vacation and wants to buy souvenirs for his two teammates. There are *n* souvenir shops along the street. In *i*-th shop Artsem can buy one souvenir for *a*_{i} dollars, and he cannot buy more than one souvenir in one shop. He doesn't want to introduce envy in his team, so he wants to buy two souvenirs with least possible difference in price.

Artsem has visited the shopping street *m* times. For some strange reason on the *i*-th day only shops with numbers from *l*_{i} to *r*_{i} were operating (weird? yes it is, but have you ever tried to come up with a reasonable legend for a range query problem?). For each visit, Artsem wants to know the minimum possible difference in prices of two different souvenirs he can buy in the opened shops.

In other words, for each Artsem's visit you should find the minimum possible value of |*a*_{s} - *a*_{t}| where *l*_{i} ≤ *s*, *t* ≤ *r*_{i}, *s* ≠ *t*.

Input

The first line contains an integer *n* (2 ≤ *n* ≤ 10^{5}).

The second line contains *n* space-separated integers *a*_{1}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 10^{9}).

The third line contains the number of queries *m* (1 ≤ *m* ≤ 3·10^{5}).

Next *m* lines describe the queries. *i*-th of these lines contains two space-separated integers *l*_{i} and *r*_{i} denoting the range of shops working on *i*-th day (1 ≤ *l*_{i} < *r*_{i} ≤ *n*).

Output

Print the answer to each query in a separate line.

Example

Input

8

3 1 4 1 5 9 2 6

4

1 8

1 3

4 8

5 7

Output

0

1

1

3

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 06:59:41 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|