#include <bits/stdc++.h>
using namespace std;
long long a[500000], ucln, n, res;
long long gcd(long long A, long long B) {
  if (B == 0)
    return A;
  else
    return gcd(B, A % B);
}
int main() {
  cin >> n;
  ucln = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    ucln = gcd(a[i], ucln);
    if (ucln == 1) {
      cout << 1;
      return 0;
    }
  }
  for (int i = 1; i <= ucln / i; i++) {
    if (ucln % i == 0) {
      res++;
      if (i != ucln / i) res++;
    }
  }
  cout << res;
}
