import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      alias Entry = Tuple!(long, "a", long, "g");
      auto st0 = new Entry[N + 1];
      auto st1 = new Entry[N + 1];
      int top0, top1;
      st0[0] = st1[0] = Entry(0, 0);
      
      void push(long a) {
        const e = Entry(a, gcd(st1[top1].g, a));
        st1[++top1] = e;
      }
      void pop() {
        if (top0 == 0) {
          for (; top1 > 0; ) {
            const a = st1[top1--].a;
            const e = Entry(a, gcd(st0[top0].g, a));
            st0[++top0] = e;
          }
        }
        --top0;
      }
      long get() {
        return gcd(st0[top0].g, st1[top1].g);
      }
      
      long ans;
      for (int i = 0, j; i < N; ++i) {
        for (; get() != 1; ) {
          if (j == N) {
            goto done;
          }
          push(A[j]);
          ++j;
        }
        // [i, j), ..., [i, N)
        ans += N - j + 1;
        pop();
      }
     done:
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}