/* -*- coding: utf-8 -*-
 *
 * 1036.cc:  No.1036 Make One With GCD 2 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 500000;
const int MAX_E2 = 1 << 20; // = 1048576

/* typedef */

typedef long long ll;

template <typename T, const int MAX_E2>
struct SegTreeGCD {
  int e2;
  T nodes[MAX_E2];
  SegTreeGCD() {}

  void init(int n) {
    for (e2 = 1; e2 < n; e2 <<= 1);
  }

  T &get(int i) { return nodes[e2 - 1 + i]; }
  void set(int i, T v) { get(i) = v; }

  T __gcd(T m, T n) {
    if (m == 0) return n;
    if (n == 0) return m;
    if (m < n) swap(m, n);
    while (n > 0) {
      T r = m % n;
      m = n; n = r;
    }
    return m;
  }
  
  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = __gcd(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  T gcd_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = gcd_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = gcd_range(r0, r1, k * 2 + 2, im, i1);
    return __gcd(v0, v1);
  }
  T gcd_range(int r0, int r1) { return gcd_range(r0, r1, 0, 0, e2); }
};

/* global variables */

SegTreeGCD<ll,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  st.init(n);

  for (int i = 0; i < n; i++) {
    ll ai;
    scanf("%lld", &ai);
    st.set(i, ai);
  }
  st.setall();

  //for (int i = 0; i < n; i++) {
  //for (int j = i; j <= n; j++) printf("%lld ", st.gcd_range(i, j));
  //putchar('\n');
  //}

  ll sum = 0;
  for (int i = 0, j = 0; i < n; i++) {
    if (j < i) j = i;
    ll gi = st.gcd_range(i, j);
    while (j < n) {
      ll gj = st.__gcd(gi, st.get(j));
      if (gj == 1) break;
      gi = gj;
      j++;
    }

    sum += j - i;
    //printf("%d: %d\n", i, j0 - i);
  }

  printf("%lld\n", (ll)n * (n + 1) / 2 - sum);
  return 0;
}