Given an array a of n integers, you are asked to answer q queries. All the queries have the form: βWhat is the sum of elements in the array a between indices [l; r]?β (both endpoints are inclusive and the indexing starts from 0). This time the number of queries and the size of the array are significantly larger. Can you think of a way to answer those queries faster?

Input

The first line of the input contains a single integer n - the number of elements in the array (1 β€ n β€ ). The next line contains n integers separated by a space, that represent the elements of the array .

The following line contains a single integer q - the number of queries (1 β€ q β€ ). The next q lines contain queries of the form .

Output

The program should print q lines, each of which is the sum of elements in the array a between indices (both inclusive).