#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;

ll temp;
inline ll gcd(ll a, ll b)
{
  if (a < b)
    swap(a, b);
  while (b != 0)
  {
    temp = b;
    b = a % b;
    a = temp;
  }
  return a;
}

ll a[500010];

ll n;
int N;
ll dat[2000010];

void init()
{
  for (int i = n; i < N; ++i)
    dat[i + N - 1] = 0;
  for (int i = N - 2; i >= 0; --i)
    dat[i] = gcd(dat[i * 2 + 1], dat[i * 2 + 2]);
}

ll val_left, val_right;
ll query(int a, int b)
{
  val_left = 0;
  val_right = 0;
  for (a += (N - 1), b += (N - 1); a < b; a >>= 1, b >>= 1)
  {
    if ((a & 1) == 0)
    {
      val_left = gcd(val_left, dat[a]);
    }
    if ((b & 1) == 0)
    {
      val_right = gcd(val_right, dat[--b]);
    }
  }
  return gcd(val_left, val_right);
}

int main()
{
  /*
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
*/

  cin >> n;
  N = 1;
  while (N < n)
    N *= 2;
  int i;
  for (i = 0; i < n; i++)
    scanf("%lld", &dat[i + N - 1]);
  init();
  if (dat[0] > 1)
  {
    printf("0\n");
    return 0;
  }
  ll ans = (n + 1) * n / 2;
  int lo, hi, mi;
  for (i = 0; i < n; i++)
  {
    lo = i, hi = n + 1;
    while (hi - lo > 1)
    {
      mi = (lo + hi) / 2;
      if (query(i, mi) > 1)
        lo = mi;
      else
        hi = mi;
    }
    ans -= (lo - i);
  }
  printf("%lld\n", ans);

  return 0;
}