using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    // static void Test()
    // {
    //     var r = new Random();
    //     var n = 500000;
    //     var a = new long[n];
    //     for (var i = 0; i < n; ++i) a[i] = r.NextInt64(1_000_000_000_000_000_000) + 1;

    //     var start = DateTime.Now;
    //     WriteLine(GCD(n, a));
    //     WriteLine((DateTime.Now - start).TotalSeconds);
    // }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        WriteLine(GCD(n, a));
    }
    static long GCD(int n, long[] a)
    {
        dic = new Dictionary<long, Dictionary<long, long>>();
        var seg = new SegmentTree<long>(a, new SegOp());
        var ans = 0L;
        for (var i = 0; i < n; ++i)
        {
            if (a[i] > 1)
            {
                ans += n - seg.MaxRight(i, (x) => x > 1);
            }
            else ans += n - i;
        }
        return ans;
    }
    static Dictionary<long, Dictionary<long, long>> dic;
    static long GCD(long a, long b)
    {
        if (a < b) return GCD(b, a);
        if (a % b == 0) return b;
        if (a < 1_000_000)
        {
            if (dic.ContainsKey(a) && dic[a].ContainsKey(b)) return dic[a][b];
            var ans = GCD(b, a % b);
            if (!dic.ContainsKey(a)) dic[a] = new Dictionary<long, long>();
            dic[a][b] = ans;
            return ans;
        }
        else return GCD(b, a % b);
    }
    struct SegOp : ISegmentTreeOperator<long>
    {
        public long Identity => -1;

        public long Operate(long x, long y)
        {
            if (x == Identity) return y;
            if (y == Identity) return x;
            return GCD(x, y);
        }
    }
    interface ISegmentTreeOperator<T>
    {
        T Identity { get; }
        T Operate(T x, T y);
    }
    class SegmentTree<T>
    {
        int _n;
        int size;
        int log;
        T[] d;
        ISegmentTreeOperator<T> op;
        void Update(int k)
        {
            d[k] = op.Operate(d[2 * k], d[2 * k + 1]);
        }
        public SegmentTree(int n, ISegmentTreeOperator<T> op)
        {
            this.op = op;
            _n = n;
            size = 1;
            while (size < n) size <<= 1;
            log = CountRZero(size);
            d = new T[2 * size];
            for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
        }
        public SegmentTree(T[] v, ISegmentTreeOperator<T> op)
        {
            this.op = op;
            _n = v.Length;
            size = 1;
            while (size < v.Length) size <<= 1;
            log = CountRZero(size);
            d = new T[2 * size];
            for (var i = 0; i < d.Length; ++i) d[i] = op.Identity;
            for (var i = 0; i < v.Length; ++i) d[size + i] = v[i];
            for (var i = size - 1; i >= 1; --i) Update(i);
        }
        int CountRZero(int n)
        {
            var ans = 0;
            while (n % 2 == 0)
            {
                ++ans;
                n >>= 1;
            }
            return ans;
        }
        public T this[int p]
        {
            get { return d[p + size]; }
            set
            {
                p += size;
                d[p] = value;
                for (var i = 1; i <= log; ++i) Update(p >> i);
            }
        }
        public T Prod(int l, int r)
        {
            var sml = op.Identity;
            var smr = op.Identity;
            l += size;
            r += size;
            while (l < r)
            {
                if ((l & 1) != 0) sml = op.Operate(sml, d[l++]);
                if ((r & 1) != 0) smr = op.Operate(d[--r], smr);
                l >>= 1;
                r >>= 1;
            }
            return op.Operate(sml, smr);
        }
        T AllProd() => d[1];
        int MinLeft(int r, Predicate<T> f)
        {
            if (r == 0) return 0;
            r += size;
            T sm = op.Identity;
            do
            {
                r--;
                while (r > 1 && (r % 2) != 0) r >>= 1;
                if (!f(op.Operate(d[r], sm)))
                {
                    while (r < size)
                    {
                        r = 2 * r + 1;
                        if (f(op.Operate(d[r], sm)))
                        {
                            sm = op.Operate(d[r], sm);
                            r--;
                        }
                    }
                    return r + 1 - size;
                }
                sm = op.Operate(d[r], sm);
            }
            while ((r & -r) != r);
            return 0;
        }
        public int MaxRight(int l, Predicate<T> f)
        {
            if (l == _n) return _n;
            l += size;
            T sm = op.Identity;
            do
            {
                while (l % 2 == 0) l >>= 1;
                if (!f(op.Operate(sm, d[l])))
                {
                    while (l < size)
                    {
                        l = 2 * l;
                        if (f(op.Operate(sm, d[l])))
                        {
                            sm = op.Operate(sm, d[l]);
                            ++l;
                        }
                    }
                    return l - size;
                }
                sm = op.Operate(sm, d[l]);
                ++l;
            } while ((l & -l) != l);
            return _n;
        }
    }
}