#include <iostream> #include <vector> #include <algorithm> #include <climits> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a.begin(), a.end()); long long min_dist = LLONG_MAX; for (int i = 1; i < n; i++) { long long diff = (long long)a[i] - a[i - 1]; if (diff < min_dist) { min_dist = diff; } } cout << min_dist << endl; return 0; }