import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;


public class Main{

	public static void main(String[] args) {
		new Main().run();
	}
	
	class SegTree {
		int n=1;
		long[] v;
		
		public SegTree(int n) {
			while (this.n<n) this.n*=2;
			v=new long[2*this.n];
		}
		
		void setVal(int k,long val) {
			k+=n;
			v[k]=val;
			while (k!=1) {
				k/=2;
				v[k]=gcd(v[2*k],v[2*k+1]);
			}
		}
		
		long query(int a,int b) {
			return query(1,n+1,a+1,b+1,1);
		}
		
		long query(int l,int r,int a,int b,int k) {
			if (r<=a||b<=l) {
				return 0;
			} else if (a<=l&&r<=b) {
				return v[k];
			} else {
				long vl=query(l,(l+r)/2,a,b,2*k);
				long vr=query((l+r)/2,r,a,b,2*k+1);
				return gcd(vl,vr);
			}
		}
	}
	
	long gcd(long a,long b) {
		if (a>b) return gcd(b,a);
		if (a==0) return b;
		if (a%2==0 && b%2==0) return 2*gcd(a/2,b/2);
		if (a%2==0) return gcd(a/2,b);
		if (b%2==0) return gcd(a,b/2);
		return gcd(b%a,a);
	}
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long[] A=new long[N];
		SegTree seg=new SegTree(N+1);
		for (int i=0;i<N;++i) {
			A[i]=sc.nextLong();
			seg.setVal(i, A[i]);
		}
		long ans=0;
		int t=0;
		for (int s=0;s<N;++s) {
			t=Math.max(t, s);
			long cur=seg.query(s, t);
			while (cur!=1 && t<N) {
				cur=gcd(cur,A[t++]);
			}
			if (cur==1) {
				ans+=N-(t-1);
			}
		}
		System.out.println(ans);
	}
	
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}