// yuki 917 Make One With GCD
// 2020.1.21 bal4u

#include <stdio.h>
#include <string.h>

typedef long long ll;

int getchar_unlocked(void);
#define gc() getchar_unlocked()
//#define gc() getchar()

int in() {  // 整数の入力
	int n = 0; int c = gc();
	if (c == '-') {	c = gc();
		do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
		return -n;
	}
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int gcd(int a, int b)
{
	int r;
	while (b != 0) r = a % b, a = b, b = r;
	return a;
}

#define HASHSIZ 2999 // 19997
#define MAX HASHSIZ
typedef struct { int a, id; } HASH;
HASH hash[HASHSIZ+5], *hashend = hash + HASHSIZ;

int lookup(int a) {
	HASH *p = hash + a % HASHSIZ;
	while (p->a) {
		if (p->a == a) return p->id;
		if (++p == hashend) p = hash;
	}
	return -1;
}

void insert(int a, int id) {
	HASH *p = hash + a % HASHSIZ;
	while (p->a) {
		if (p->a == a) return;
		if (++p == hashend) p = hash;
	}
	p->a = a, p->id = id;
}

typedef struct { int a; ll f; } T;
T a[MAX+5]; int n;

void Qsort(T *a, int l, int r) {
	int i, j, m; T t;
	
	i = l, j = r, m = a[(l+r) >> 1].a;
	while (1) {
		while (a[i].a < m) i++;
		while (m < a[j].a) j--;
		if (i >= j)	break;
		t = a[i], a[i] = a[j], a[j] = t;
		i++, j--;
	}
	if (l+1 < i) Qsort(a, l, i-1);
	if (j+1 < r) Qsort(a, j+1, r);
}

int main()
{
	int i, j, t, A, N;
	
	N = in();
	for (i = 0; i < N; ++i) {
		A = in();
		
		memset(hash, 0, sizeof(hash));
		for (j = 0; j < n; ++j) insert(a[j].a, j);
		
		int _n = n;
		for (j = 0; j < _n; ++j) {
			int x = gcd(a[j].a, A);
			if ((t = lookup(x)) >= 0) a[t].f += a[j].f;
			else {
				a[n].a = x, a[n].f += a[j].f;
				insert(x, n++);
			}
		}
		if ((t = lookup(A)) >= 0) a[t].f++;
		else a[n].a = A, a[n].f++, ++n;

		Qsort(a, 0, n-1);
	}
	
	if (a[0].a != 1) puts("0");
	else printf("%lld\n", a[0].f);
	return 0;
}