#include <bits/stdc++.h>
using namespace std;
int removeDuplicates(long long int arr[], long long int n) {
  if (n == 0 || n == 1) return n;
  long long int j = 0;
  for (long long int i = 0; i < n - 1; i++)
    if (arr[i] != arr[i + 1]) arr[j++] = arr[i];
  arr[j++] = arr[n - 1];
  return j;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  long long int n;
  cin >> n;
  long long int arr[n];
  for (long long int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  long long int a1 = arr[0];
  for (int j = 1; j < n; j++) {
    a1 = gcd(a1, arr[j]);
  }
  long long int count = 0;
  for (long long int i = 1; i <= sqrt(a1); i++) {
    if ((a1 % i) == 0) {
      if (i == a1 / i)
        count++;
      else
        count = count + 2;
    }
  }
  cout << count << endl;
}
