#include #define rep(i,n) for(int i = 0; i < (n); i++) using namespace std; typedef long long ll; int main(){ cin.tie(0); ios::sync_with_stdio(0); int N; cin >> N; vector x(N); set se; rep(i,N){ cin >> x[i]; se.insert(x[i]); } if(se.size() == 1){ cout << 0 << endl; return 0; } sort(x.begin(), x.end()); int ans = 1e9; rep(i,N-1){ if(x[i+1] - x[i] < ans && x[i+1] != x[i]){ ans = x[i+1] - x[i]; } } cout << ans << endl; }