#include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#include <chrono>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=a;i<b;++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,a) rrepi(i,a,0)
#define rrepi(i,a,b) for(int i=a-1;i>=b;--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}

const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll MOD3 = 1e6;
const ll EPS = 1e-10;
int sgn(const double a){
    return (a < -EPS ? -1 : (a > EPS ? +1 : 0));
}
typedef pair<int,int> pi;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> tri;
typedef pair<double,double> point;
typedef complex<double> Point;
typedef string::const_iterator State;
const ll MAX = 105;
constexpr ll nx[4] = {-1,0,1,0};
constexpr ll ny[4] = {0,1,0,-1};

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    cins(all(a));
    map<int,int> t;
    int mi = 1e9;
    rep(i,n){
        chmin(mi,a[i]);
        rep(j,1,sqrt(a[i])+1){
            if (a[i]%j != 0) continue;
            if (t[j] == 0){
                t[j] = a[i];
            }
            else{
                t[j] = gcd(t[j],a[i]);
            }
            int m = j;
            j = a[i]/m;
            if (t[j] == 0){
                t[j] = a[i];
            }
            else{
                t[j] = gcd(t[j],a[i]);
            }
            j = m;
        }
    }
    int ans = 0;
    //PRINT(mi);
    for (auto [c,d]:t){
        if (c > mi) break;
        if (c == d) ans++;
        //PRINT(c << " " << d);
    }
    PRINT(ans);
}

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    vector<char> a(12);
    for(int i=0;i<12;i++){
        cin >> a.at(i);
    }
    int c=0;
    for(int i=0;i<12;i++){
        if(a.at(i)=='Z' && a.at(i+1)=='O' && a.at(i+2)=='N' && a.at(i+3)== 'e'){
            c++;
        }
    }
    cout << c;
}