算贡献乱搞即可。。 然而。。不会搞。。。好不容易才搞过。。。
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define fi first
#define se second
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
#define Fast_IO ios_base::sync_with_stdio(0);cin.tie(0)
int n;
int a[100100];
int l[100100];
int r[100100];
int hs[100100];
int main()
{
while(cin>>n)
{
memset(l, 0, sizeof(l));
for(int i=1; i<=n; i++)
r[i] = n+1;
rep(i, 1, n)
scanf("%d", &a[i]);
memset(hs, 0, sizeof(hs));
rep(i, 1, n)
{
for(int j=1; j*j<=a[i]; j++)
if(a[i]%j == 0)
l[i] = max(l[i], max(hs[j], hs[a[i]/j]));
hs[a[i]] = i;
}
memset(hs, 0x3f3f3f3f, sizeof(hs));
per(i, n, 1)
{
for(int j=1; j*j<=a[i]; j++)
if(a[i] %j == 0)
r[i] = min(r[i], min(hs[j], hs[a[i]/j]));
hs[a[i]] = i;
}
ll res = 0;
rep(i, 1, n)
res += (ll)(i-l[i])*(r[i]-i)%mod;
cout<<res%mod<<endl;
}
return 0;
}