You are given an array a consisting of n integer numbers.

Let instability of the array be the following value: max_{i = 1}^{n} a_i - min_{i = 1}^{n} a_i.

You have to remove exactly one element from this array to minimize instability of the resulting (n-1)-elements array. Your task is to calculate the minimum possible instability.

Input

The first line of the input contains one integer n (2 ≤ n ≤ 10^5) — the number of elements in the array a.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^5) — elements of the array a.

Output

Print one integer — the minimum possible instability of the array if you have to remove exactly one element from the array a.

Examples

Input


4
1 3 3 7


Output


2


Input


2
1 100000


Output


0

Note

In the first example you can remove 7 then instability of the remaining array will be 3 - 1 = 2.

In the second example you can remove either 1 or 100000 then instability of the remaining array will be 100000 - 100000 = 0 and 1 - 1 = 0 correspondingly.



import java.util.Scanner;

/**
 * @author Lu Kongwen
 * @version Create time：2019-1-4 上午10:30:20
 * @Description
 */
public class Test {

	public static void main(String args[]) {

		init1();
	}

	public static void init1() {

		Scanner scan = new Scanner(System.in);

		int n = scan.nextInt();

		Integer max1 = Integer.MIN_VALUE, max2 = Integer.MIN_VALUE;
		Integer min1 = Integer.MAX_VALUE, min2 = Integer.MAX_VALUE;

		while (n-- > 0) {

			int a = scan.nextInt();

			if (a > max1) {
				max2 = max1;
				max1 = a;
			} else {
				if (a > max2) {
					max2 = a;
				}
			}

			if (a < min1) {
				min2 = min1;
				min1 = a;
			} else {
				if (a < min2) {
					min2 = a;
				}
			}
		}

		System.out.println(Math.min(max1 - min2, max2 - min1));

	}

	

}
