#include <bits/stdc++.h>
using namespace std;
long long int gcdx(long long int a, long long int b) {
  if (a == 0) return b;
  return gcdx(b % a, a);
}
long long int count(long long int n) {
  long long int ans = 0;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        ans++;
      else {
        ans += 2;
      }
    }
  }
  return ans;
}
int main() {
  int n;
  cin >> n;
  long long int arr[n];
  queue<long long int> q;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    q.push(arr[i]);
  }
  long long int ans = 1;
  while (q.size() > 1) {
    long long int a, b;
    a = q.front();
    q.pop();
    b = q.front();
    q.pop();
    long long int pre = gcdx(a, b);
    q.push(pre);
  }
  cout << count(q.front()) << endl;
}
