// 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
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;
}

#define MAX 200
int dp[55][MAX+5]; ll f[55][MAX+5];
int n;

int main()
{
	int i, j, t, A, N;
	
	N = in();
	for (i = 1; i <= N; ++i) {
		A = in();

		memcpy(dp[i], dp[i-1], sizeof(dp[0]));
		memcpy(f[i], f[i-1], sizeof(f[0]));
		
		int _n = n;
		for (j = 0; j < _n; ++j) {
			int x = gcd(dp[i-1][j], A);
			if ((t = lookup(x)) >= 0) f[i][t] += f[i-1][j];
			else {
				dp[i][n] = x, f[i][n] += f[i-1][j];
				insert(x, n++);
			}
		}
		if ((t = lookup(A)) >= 0) f[i][t]++;
		else {
			dp[i][n] = A, f[i][n]++;
			insert(A, n++);
		}
	}
	
	for (j = 0; j < n; ++j) {
		if (dp[N][j] == 1) {
			printf("%lld\n", f[N][j]);
			return 0;
		}
	}
	puts("0");
	return 0;
}