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

const int N = 1e5 + 10;
int a[N];

int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);
	}
	sort(a, a + n);
	int ans = n;
	int mi = INT_MAX;
	for (int i = 1; i < n; i++)
	{
		mi = min(mi, a[i] - a[i-1]);
	}
	for (int i = 1; i < n; i++)
	{
		ans += (a[i] - a[i-1]) / mi - 1;
	}
	printf("%d", ans);
	return 0;
}

提交记录