/*
Problem C. Collatz Conjecture
23 de Junio de 2018
*/

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

int main() {
    int n;
    cin >> n;
    int s[n];
    vector<int> gcds;
    for (int i = 0; i < n && cin >> s[i]; i++);
    for (int i = 0; i < n; ++i)
        for (int j = i; j < n; ++j)
            gcds.push_back(i == j ? s[j] : __gcd(gcds.back(), s[j]));
    set<int> values(gcds.begin(), gcds.end());
    cout << values.size() << endl;
    return 0;
}