Problem Description

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 $$\sum_{i=1}^{n}\sum_{j=i}^{n}f(i,j) \ mod \ （10^{9}+7）.$$

Input

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(0<a_i<=10000)

Output

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

5
1 2 3 4 5

23

Author

FZUACM