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

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

constexpr int SIZE = 100;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int N;
	cin >> N;

	vector<ll> A;
	ll last = -1LL;
	for (int i = 0; i < N; ++i) {
		ll v;
		cin >> v;
		if (v != last) A.push_back(v);
	}
	N = (int)A.size();

	unordered_set<ll> gcds;
	for (int l = 0; l < N; ++l) {
		ll g = A[l];
		for (int r = l; r < N && r - l <= SIZE; ++r) {
			g = gcd(g, A[r]);
			gcds.insert(g);
		}
	}
	cout << gcds.size() << endl;

	return 0;
}