OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there's no j(l<=j<=r,j<>i) satisfy ai mod aj=0,now OO want to know $$\sum_{i=1}^{n}\sum_{j=i}^{n}f(i,j) \ mod \ （10^{9}+7）.$$
输入解释
There are multiple test cases. Please process till EOF. In each test case: First line: an integer n(n<=10^5) indicating the size of array Second line:contain n numbers ai(0<ai<=10000)
输出解释
For each tests: ouput a line contain a number ans.