#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>

using namespace std;

long long int dp[51][12501];
map <int, int> memo;

int gcd(int a, int b)
{
	if (b == 0)
	{
		return a;
	}
	return gcd(b, a % b);
}

int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n, t;
	vector <int> v;

	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> t;
		v.push_back(t);
	}

	set <int> S;

	for (int i = 0; i < n; i++)
	{
		for (int j = i; j < n; j++)
		{
			for (int k = j; k < n; k++)
			{
				int g = gcd(v[i], v[j]);
				g = gcd(g, v[k]);
				S.insert(g);
			}
		}
	}

	vector <int> p;
	int N = 0;
	for (auto it : S)
	{
		p.push_back(it);
		memo[it] = N++;
	}

	for (int i = 0; i < n; i++)
	{
		dp[i + 1][memo[v[i]]] += 1;
		for (int j = 0; j < N; j++)
		{
			int g = gcd(v[i], p[j]);
			//cout << g << ' ' << v[i] << ' ' << p[j] << '\n';
			dp[i + 1][memo[g]] += dp[i][j];
			dp[i + 1][j] += dp[i][j];
		}
	}

	if (p[0] != 1)
	{
		cout << 0 << '\n';
	}
	else
	{
		cout << dp[n][0] << '\n';
	}

	return 0;
}