import math

N = int(input())
A = [int(x) for x in input().split()]

sum = int(0)

def G(a, b):
    dev = A[a]
    for i in range(a+1, b+1):
        tmp = math.gcd(dev, A[i])
        if tmp < dev:
            dev = tmp
    return dev

def M(a, b):
    max = int(0)
    for i in range(a, b+1):
        if max < A[i]:
            max = A[i]
    return max

def P(a, b):
    return G(a, b) * M(a, b)

for i in range(0, N):
    for j in range(i, N):
        sum += P(i, j)

sum %= 1000000007
print(int(sum))