OO’s Sequence

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 a_i mod a_j=0,now OO want to know

∑i=1->n∑j=i->nf(i,j) mod （10e9+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 a_i(0i<=10000)

For each tests: ouput a line contain a number ans.

5
1 2 3 4 5

23

∑j=i->nf(i,j)表示f(i,j)，j从i到n连加

2015 Multi-University Training Contest 1