#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define LG (18)
#define MX (1<<LG)
#define P2(v) (!(v&(v-1)))
struct RMQx{
    int dp[MX][LG+2],G[MX],XX,O=-1;
    void ini(int*A,int n){
        if(!XX++)FT(1,MX)G[k]=O+=P2(k);
        F(n)dp[i][0]=i;
        FT(1,k-(1<<k)+n+1)F(n+1-(1<<k))
            if(A[dp[i][k-1]]>A[dp[i+(1<<(k-1))][k-1]])
                dp[i][k]=dp[i][k-1];
            else dp[i][k]=dp[i+(1<<(k-1))][k-1];      
    }
    int qy(int *A,int L,int R){
        int j(G[R-L+1]);
        if(A[dp[L][j]]>=A[dp[R-(1<<j)+1][j]])
            return dp[L][j];
        return dp[R-(1<<j)+1][j];
    }
}R;
struct RMQg{
    int dp[MX][LG+2],G[MX],XX,O=-1;
    void ini(int *A,int n){
        if(!XX++)FT(1,MX)G[k]=O+=P2(k);
        F(n)dp[i][0]=A[i];
        FT(1,k-(1<<k)+n+1)F(n+1-(1<<k))
            dp[i][k]=__gcd(dp[i][k-1],dp[i+(1<<(k-1))][k-1]);
    }
    int qy(int L,int R){
        int j(G[R-L+1]);
        return __gcd(dp[L][j],dp[R-(1<<j)+1][j]);
    }
}G;
#define MOD 1000000007
int N,A[MX],S,g,I,x,y;
bool OK(int t){
    if(t==y)return 1;
    return G.qy(I,t)<g;
}
bool ok(int t){
    if(t==x)return 1;
    return G.qy(t,I)<g;
}
int bs(int B,int E){
    int M;
    while(B+3<E)
        if(ok(M=(B+E)>>1))B=M;
        else E=M-1;
    while(!ok(E))--E;
    return E;
}
int BS(int B,int E){
    int M;
    while(B<E)
        if(OK(M=(B+E)>>1))E=M;
        else B=M+1;
    return E;
}
vi X,Y;
#define DF(B,E) (max(B,E)-min(B,E))
int go(int b,int e){
    if(b>e)return 0;
    x=b-1,y=e+1;
    I=R.qy(A,b,e);
    int S=0,J=I,F=I;
    X.clear(),Y.clear();
    X.PB(I-1),Y.PB(I+1);
    while(J<=e)g=G.qy(I,J),J=BS(J,e+1),X.PB(J-1);
    J=I;
    while(J>=b)g=G.qy(J,I),J=bs(b-1,J),Y.PB(J+1);
    FT(1,(int)X.size())FOR(i,1,(int)Y.size())
        S=(S+ll(A[I])*__gcd(G.qy(I,X[k]),G.qy(Y[i],I))%MOD*DF(X[k],X[k-1])%MOD*DF(Y[i],Y[i-1]))%MOD;
    return (ll(S)+go(b,F-1)+go(F+1,e))%MOD;
}
int main(void){
    scanf("%d",&N),ga(N,A),R.ini(A,N),G.ini(A,N);
    printf("%d\n",go(0,N-1));
    return 0;
}