#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  int n;cin>>n;
  int hoge[n];
  rep(i,n)cin>>hoge[i];
  sort(hoge,hoge+n);
  bool flag=false;
  int ans=INT_MAX;
  rep(i,n-1){
    if(hoge[i+1]!=hoge[i]){
      ans=min(hoge[i+1]-hoge[i],ans);
      flag=true;
    }
  }
  cout<<(flag?ans:0)<<endl;
}