#include<bits/stdc++.h>
using namespace std;
int n;
long long a[100010];
long long maxn, minn;
int main(){
	minn = 100000000010;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lld", &a[i]);
		minn=min(minn, a[i]);
		maxn=max(maxn, a[i]);
	}
	long long minf = 100000000010;
	sort(a+1, a+1+n);
	for(int i = 2; i <= n; i++){
		minf=min(a[i]-a[i-1], minf);
	}
	if(minf!=0)printf("%lld", (maxn-minn)/minf+1);
	else printf("%d", n);
	return 0;
}

此代码可被下方数据hack

input:
3
2 6 12
output:
6