Raghav has a beautiful array A of integers. He is very confident that he can answer any query related to this array. His friend challenges him to answer Q queries. Each query consists of an integer X.

Raghav has to tell the count of integers in his beautiful array which are perfectly divisible by X. Help Raghav to answer all queries.

Input:

First line has N, denoting the number of integers in array.

Next line contains N space separated integers in array A.

Next line has Q, denoting the number of queries.

Each of the next Q lines contains X.

Output:

For each query, print the number of integers which are perfectly divisible by X.

Constraints:

1 <= N <= 10⁵

1 <= Q <= 10⁶

1 <= X, A[ i ] <= 10⁵, where A[ i ] denotes elements of array.

NOTE: Use printf/scanf for faster input/output.