#include<iostream> #include<queue> #include<cstdio> #include<utility> #include<algorithm> #include<cmath> using namespace std; int main(){ int n;scanf("%d",&n); int *x=new int[n]; int mv=999999999; for(int i=0;i<n;i++)scanf("%d",&x[i]); sort(x,x+n); for(int i=0;i<n-1;i++){ if(x[i] != x[i+1]){ mv=min(abs(x[i]-x[i+1]),mv); } }if(mv==999999999)mv=0; cout<<mv<<endl; }