#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  for (ll& i : a) cin >> i;
  ll g = a[0];
  for (int i = 1; i < n; i++) g = gcd(g, a[i]);
  int ans = 0;
  for (ll i = 1; i * i <= g; i++) {
    if (g % i == 0) ans += g / i == i ? 1 : 2;
  }
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
