#include <bits/stdc++.h>
using namespace std;

int gcd(int a, int b) { while (b) a %= b, swap(a, b); return a; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int N; cin >> N;
	int a[64]; std::unordered_set<int> total;
	for (int ff = 0, nff = 0; cin >> a[ff++]; ff = nff, nff = 0)
		for (int i = 0; i < ff; ++i) {
			total.insert(a[nff] = gcd(a[i], a[ff-1]));
			if (!nff || a[nff] != a[nff-1]) ++nff;
		}
	cout << total.size() << endl;

	return 0;
}