跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1879. CGCDSSQ

  • ID: 1885
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 枚举
  • 数据结构
  • 数学
  • 算法思想
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

CGCDSSQ

题目描述

D. CGCDSSQ
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Given a sequence of integers a1,...,an and q queries x1,...,xq on it. For each query xi you have to count the number of pairs (l,r) such that 1≤l≤r≤n and gcd(al,al+1,...,ar)=xi.

is a greatest common divisor of v1,v2,...,vn, that is equal to a largest positive integer that divides all vi.

Input

The first line of the input contains integer n, (1≤n≤105), denoting the length of the sequence. The next line contains n space separated integers a1,...,an, (1≤ai≤109).

The third line of the input contains integer q, (1≤q≤3×105), denoting the number of queries. Then follows q lines, each contain an integer xi, (1≤xi≤109).

Output

For each query print the result in a separate line.

Examples
Input
3
2 6 3
5
1
2
3
4
6
Output
1
2
2
0
1
Input
7
10 20 3 15 1000 60 16
10
1
2
3
4
5
6
10
20
60
1000
Output
14
0
2
2
2
0
2
2
1
1

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1454 题。保留原作者与原赛事署名。