#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int N = 100010;
LL arr[N];
LL cha[N];
int n;

int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&arr[i]);
    }
    sort(arr,arr+n);
    bool flag=false;
    for(int i=1;i<n;i++)
    {
        cha[i]=arr[i]-arr[0];
        if(cha[i]==0) flag=true;
    }
    if(flag==true)
    {
        cout<<n;return 0;
    }
    int d=N;
    int minn=0;
    for(int i=1;i<n-1;i++)
    {
        minn=__gcd(cha[i],cha[i+1]);
        if(minn<d) d=minn;
    }
    int ans=(arr[n-1]-arr[0])/d+1;
    cout<<ans;
    return 0;
}