#[derive(Debug, Clone)]
struct SparseTable<T, F> {
    vals: Vec<Vec<T>>,
    operator: F,
    usize_bit_cnt: u32,
}

impl<T, F> SparseTable<T, F> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T,
{
    fn new(v: &Vec<T>, unit: T, operator: F) -> Self {
        let size = usize::max_value().count_ones() - v.len().leading_zeros();
        let size = size as usize;
        let limit = 1usize << size;
        let mut vals = Vec::with_capacity(size+1);
        vals.push(vec![unit; limit]);
        for i in 0..v.len() {
            vals[0][i] = v[i];
        }
        for i in 1..=size {
            let length = 1usize << i;
            let jsize = limit+1-length;
            vals.push(vec![unit; jsize]);
            for start in 0..jsize {
                let left = start;
                let right = start + (1usize << (i-1));
                vals[i][start] = operator(vals[i - 1][left], vals[i - 1][right]);
            }
        }

        Self {
            vals,
            operator,
            usize_bit_cnt: usize::max_value().count_ones()
        }
    }

    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }

    fn find(&self, l: usize, r: usize) -> T {
        let length = r - l;
        if length == 1 {
            return self.vals[0][l];
        }
        let idx = self.usize_bit_cnt - length.leading_zeros() - 1;
        let idx = idx as usize;
        let left = self.vals[idx][l];
        let right = self.vals[idx][r - (1usize << idx)];
        (self.operator)(left, right)
    }
}

fn gcd(a: usize, b: usize) -> usize {
    if b == 0 { return a; }
    gcd(b, a%b)
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let sparse_table = SparseTable::new(&a, 0usize, |x, y| gcd(x, y));
    let mut result = 0usize;
    for i in 0..n {
        if a[i] == 1 {
            result += n - i;
            continue;
        }
        let mut lower = i+1;
        let mut upper = n;
        while upper > lower {
            let middle = (upper + lower + 1) / 2;
            if sparse_table.find(i, middle) > 1 {
                lower = middle;
            } else {
                upper = middle - 1;
            }
        }
        result += n - upper;
    }
    println!("{}", result);}