using System; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var a = sc.Integer(n); a = a.Distinct().ToArray(); Array.Sort(a); var min = int.MaxValue; for (int i = 0; i < a.Length - 1; i++) min = Math.Min(a[i + 1] - a[i], min); if (min == int.MaxValue) min = 0; IO.Printer.Out.WriteLine(min); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString(this IEnumerable ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write(string format, T[] source) { base.Write(format, source.OfType().ToArray()); } public void WriteLine(string format, T[] source) { base.WriteLine(format, source.OfType().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region Sort and Uniquify static public partial class Algorithm { /// Unique and Sort static public T[] UniquifySort(this T[] a) where T : IComparable { return UniquifySort(a, Comparer.Default.Compare); } /// Unique and Sort static public T[] UniquifySort(this T[] a, Comparison f) { var n = a.Length; dfs(a, new T[n], f, 0, ref n); var ret = new T[n]; for (int i = 0; i < n; i++) ret[i] = a[i]; return ret; } static private void dfs(T[] a, T[] tmp, Comparison f, int l, ref int r) { if (r - l == 1) return; var m1 = (r + l) >> 1; var m2 = m1; dfs(a, tmp, f, l, ref m1); dfs(a, tmp, f, m2, ref r); int ptr = l, p = l, q = m2; while (p < m1 || q < r) { if (p == m1) tmp[ptr++] = a[q++]; else if (q == r) tmp[ptr++] = a[p++]; else { var cmp = f(a[p], a[q]); if (cmp < 0) tmp[ptr++] = a[p++]; else if (cmp == 0) p++; else tmp[ptr++] = a[q++]; } } r = ptr; while (l < r) a[l] = tmp[l++]; } } #endregion