#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int b[1000];
int main()
{
vector<int> a;
int n, x;
int max = 0;
int record = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int t;
for (int i = 0; i < n; i++)
{
if(i!=n-1)
t = a[i + 1] - a[i];
b[t]++;
if (max <b[t])
{
max = b[t];
record = t;
}
}
if(record==0){
cout<<n;
}
else{
cout<<(a[n-1]-a[0])/record+1;
}
return 0;
}
08-15
1126
11-05
1336