No Pain No Game HDU - 4630 线段树+离线处理

Life is a game,and you lose it,so you suicide. 
But you can not kill yourself before you solve this problem: 
Given you a sequence of number a 1, a 2, ..., a n.They are also a permutation of 1...n. 
You need to answer some queries,each with the following format: 
If we chose two number a,b (shouldn't be the same) from interval [l, r],what is the maximum gcd(a, b)? If there's no way to choose two distinct number(l=r) then the answer is zero.

Input

First line contains a number T(T <= 5),denote the number of test cases. 
Then follow T test cases. 
For each test cases,the first line contains a number n(1 <= n <= 50000). 
The second line contains n number a 1, a 2, ..., a n. 
The third line contains a number Q(1 <= Q <= 50000) denoting the number of queries. 
Then Q lines follows,each lines contains two integer l, r(1 <= l <= r <= n),denote a query.