Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
E. Array Queries

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard output*a* is an array of *n* positive integers, all of which are not greater than *n*.

You have to process *q* queries to this array. Each query is represented by two numbers *p* and *k*. Several operations are performed in each query; each operation changes *p* to *p* + *a*_{p} + *k*. There operations are applied until *p* becomes greater than *n*. The answer to the query is the number of performed operations.

Input

The first line contains one integer *n* (1 ≤ *n* ≤ 100000).

The second line contains *n* integers — elements of *a* (1 ≤ *a*_{i} ≤ *n* for each *i* from 1 to *n*).

The third line containts one integer *q* (1 ≤ *q* ≤ 100000).

Then *q* lines follow. Each line contains the values of *p* and *k* for corresponding query (1 ≤ *p*, *k* ≤ *n*).

Output

Print *q* integers, *i*th integer must be equal to the answer to *i*th query.

Example

Input

3

1 1 1

3

1 1

2 1

3 1

Output

2

1

1

Note

Consider first example:

In first query after first operation *p* = 3, after second operation *p* = 5.

In next two queries *p* is greater than *n* after the first operation.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/16/2021 18:07:59 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|