#!/bin/python3

import sys
def gcd(x, y):
    while y != 0:
        (x, y) = (y, x % y)
    return x
def sumRange(L,a,b):
    sum=0
    for i in range(a,b+1,1):
        sum +=L[i]
    return sum
def gcdRange(L,a,b):
    g = L[0]
    for i in range(a+1,b+1,1):
        g=gcd(g,L[i])
    return g
def maximum(L,a,b):
    maxi=0
    for i in range(a,b,1):
        maxi =max(i,i+1)
    return maxi
def maximumValue(a):
    maxi = 0
    for i in range(0,len(a)+1):
        for j in range(i,len(a)+1):
            s = sumRange(a,i,j)
            m = maximum(a,i,j)
            g = gcdRange(a,i,j)
            maxi += g*(s - m)
    return maxi

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = maximumValue(a)
    print(result)