#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);
}
long long findGCD(long long arr[], long long n) {
  long long result = arr[0];
  for (long long i = 1; i < n; i++) {
    result = gcd(arr[i], result);
  }
  return result;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, g;
  cin >> n;
  long long count = 0;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  g = findGCD(a, n);
  if (g == 1) {
    cout << 1 << endl;
    return 0;
  }
  for (long long i = 1; i * i <= g; i++) {
    if (g % i == 0) {
      count++;
      if (i != g / i) {
        count++;
      }
    }
  }
  cout << count << endl;
  return 0;
}
