#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using tiii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} #define chmax(a,b) a=max(a,b) /*Coding Space*/ int main(){ int n; cin >> n; vi input(n); rep(i,n) cin >> input[i]; sort(ALL(input)); if(n == 1){ cout << 0 << endl; return 0; } int ans = INF; rep(i,n-1){ if(input[i] != input[i+1]) ans = min(ans, abs(input[i+1] - input[i])); } if(ans == INF) cout << 0 << endl; else cout << ans << endl; }