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.

from __future__ import division
from fractions import Fraction
import math
import random,bisect
import sys
#import os
#import random
#import re
from sys import stdin, stdout
#from collections import Counter,deque,OrderedDict,defaultdict
#from itertools import permutations,ansduct,combinations
#from heapq import heapify,heappush,heappop,heappushpop,heapify,heapreplace,nlargest,nsmallest
#import numpy as np
#from operator import mul

MOD=10**6+3
INF=float('+inf')

def si():
	return str(stdin.readline())
def ii():
    return int(raw_input())
def mi():
    return map(int, raw_input().split())
def li():
    return [int(i) for i in raw_input().split()]
def debug(x):
	return stdout.write(str(x))
def limul(list):
	return eval('*'.join(str(item) for item in list))

"-----------------------------------------------"

def main():
	n=ii()
	a=li()
	a.sort()
	print(min(a[-1]-a[1],a[-2]-a[0]))



















main()
