CodeForces 385C Bear and Prime Numbers

C. Bear and Prime Numbers

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Recently, the bear started studying data structures and faced the following problem.

You are given a sequence of integers x₁, x₂, ..., x_n of length n and m queries, each of them is characterized by two integers l_i, r_i. Let's introduce f(p) to represent the number of such indexes k, that x_k is divisible by p. The answer to the query l_i, r_i is the sum: , where S(l_i, r_i) is a set of prime numbers from segment [l_i, r_i] (both borders are included in the segment).

Help the bear cope with the problem.

Input

The first line contains integer n (1 ≤ n ≤ 10⁶). The second line contains n integers x₁, x₂, ..., x_n (2 ≤ x_i ≤ 10⁷). The numbers are not necessarily distinct.

The third line contains integer m (1 ≤ m ≤ 50000). Each of the following m lines contains a pair of space-separated integers, l_i and r_i (2 ≤ l_i ≤ r_i ≤ 2·10⁹) — the numbers that characterize the current query.

Output

Print m integers — the answers to the queries on the order the queries appear in the input.

Examples

Input

6
5 5 7 10 14 15
3
2 11
3 12
4 4

Output

9
7
0

Input

7
2 3 5 7 11 4 8
2
8 10
2 123

Output

0
7

Note

Consider the first sample. Overall, the first sample has 3 queries.

1. The first query l = 2, r = 11 comes. You need to count f(2) + f(3) + f(5) + f(7) + f(11) = 2 + 1 + 4 + 2 + 0 = 9.
2. The second query comes l = 3, r = 12. You need to count f(3) + f(5) + f(7) + f(11) = 1 + 4 + 2 + 0 = 7.
3. The third query comes l = 4, r = 4. As this interval has no prime numbers, then the sum equals 0.

题意：给定n个数，然后询问一个区间内的所有素数能整出这n个数的个数的和。

思路：用埃氏筛法的思路，先预处理（1-m）这个区间内的答案。具体方法见代码。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N = 1e7;

bool is_prime[N + 1];
int x[N + 1];
int quest[N + 1];

void sieve() {   //预处理
    for(int i = 2; i <= N; ++i) {
        if(!is_prime[i]) {
            for(int j = i; j <= N; j += i) {
                quest[i] += x[j];
                is_prime[j] = true;
            }
        }
    }
    for(int i = 1; i <= N; ++i) quest[i] += quest[i - 1];
}



int main()
{
    int n, q, l, r, temp;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &temp);
        x[temp]++;
    }
    sieve();
    scanf("%d", &q);
    for(int i = 1; i <= q; ++i) {
        scanf("%d%d", &r, &l);
        if(r >= N) r = N;
        if(l >= N) l = N - 1;
        printf("%d\n", quest[l] - quest[r - 1]);   //查询
    }
    return 0;
}