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

#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m);i>=(int)(n);--i)
#define debug(x) cout << #x << "=" << (x) << endl;

template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> void fail(T v){cout << v << endl;exit(0);}
//template end

void solve(){
  int N;
  cin>>N;
  int res=INT_MAX;
  vector<int> xs(N);
  rep(i,N)
    cin>>xs[i];
  sort(xs.begin(),xs.end());
  rep(i,N-1)
    if(xs[i]!=xs[i+1])
      chmin(res,xs[i+1]-xs[i]);
  if(res==INT_MAX)
    cout<<0<<endl;
  else cout<<res<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}