捞

#include<bits/stdc++.h>
using namespace std;
int a[200000],ans[100001],n,k,sum=1,minn=10e8;
int main()
{
    cin>>n;
    for(int register i=1;i<=n;++i)
    	cin>>a[i];
    sort(a+1,a+n+1);
 	for(int i=1;i<=n;i++)
    	if(a[i]+1==a[i+1])
        	sum++;
        else
			if(a[i]==a[i+1])
        		continue;
        	else
        	{
            	ans[++k]=sum;
            	sum=1;
        	}
    for(int register i=1;i<=k;++i)
    	minn=min(ans[i],minn);
    cout<<minn;
    return 0;
}