#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  int n;
  cin >> n;
  vector<long long> a(n);
  cin >> a[0];
  long long G = a[0];
  for (int i = 1; i < n; i++) {
    cin >> a[i];
    G = gcd(G, a[i]);
  }
  int count = 2;
  if (G == 1) {
    count--;
  }
  for (long long i = 2; i * i <= G; i++) {
    if (G % i == 0) count += 2;
    if (i * i == G) count--;
  }
  cout << count << '\n';
}
