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

D. Huffman Coding on Segment

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAlice wants to send an important message to Bob. Message *a* = (*a*_{1}, ..., *a*_{n}) is a sequence of positive integers (characters).

To compress the message Alice wants to use binary Huffman coding. We recall that binary Huffman code, or binary prefix code is a function *f*, that maps each letter that appears in the string to some binary string (that is, string consisting of characters '0' and '1' only) such that for each pair of different characters *a*_{i} and *a*_{j} string *f*(*a*_{i}) is not a prefix of *f*(*a*_{j}) (and vice versa). The result of the encoding of the message *a*_{1}, *a*_{2}, ..., *a*_{n} is the concatenation of the encoding of each character, that is the string *f*(*a*_{1})*f*(*a*_{2})... *f*(*a*_{n}). Huffman codes are very useful, as the compressed message can be easily and uniquely decompressed, if the function *f* is given. Code is usually chosen in order to minimize the total length of the compressed message, i.e. the length of the string *f*(*a*_{1})*f*(*a*_{2})... *f*(*a*_{n}).

Because of security issues Alice doesn't want to send the whole message. Instead, she picks some substrings of the message and wants to send them separately. For each of the given substrings *a*_{li}... *a*_{ri} she wants to know the minimum possible length of the Huffman coding. Help her solve this problem.

Input

The first line of the input contains the single integer *n* (1 ≤ *n* ≤ 100 000) — the length of the initial message. The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 100 000) — characters of the message.

Next line contains the single integer *q* (1 ≤ *q* ≤ 100 000) — the number of queries.

Then follow *q* lines with queries descriptions. The *i*-th of these lines contains two integers *l*_{i} and *r*_{i} (1 ≤ *l*_{i} ≤ *r*_{i} ≤ *n*) — the position of the left and right ends of the *i*-th substring respectively. Positions are numbered from 1. Substrings may overlap in any way. The same substring may appear in the input more than once.

Output

Print *q* lines. Each line should contain a single integer — the minimum possible length of the Huffman encoding of the substring *a*_{li}... *a*_{ri}.

Example

Input

7

1 2 1 3 1 2 1

5

1 7

1 3

3 5

2 4

4 4

Output

10

3

3

5

0

Note

In the first query, one of the optimal ways to encode the substring is to map 1 to "0", 2 to "10" and 3 to "11".

Note that it is correct to map the letter to the empty substring (as in the fifth query from the sample).

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/29/2017 10:15:22 (c3).

Desktop version, switch to mobile version.
User lists

Name |
---|