시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 64 MB41373093.750%

## 문제

$2n$ newbie students came to competitive programming practice. Each student is characterized by his IQ level: the $i$-th student has IQ $a_i$.

The coach wants to break students up into teams of two people. Each team is characterized by a team IQ that is equal to the sum of the team members IQ levels. For example, if a team is formed from students $i$ and $j$, the team IQ is $a_i + a_j$. One team is stronger than the other if its team IQ is greater.

By the coach's opinion, practice will be much more productive if the difference between team IQs of the strongest and the weakest team is as small as possible. Help the coach determine the minimum value $A$ for which it is possible to form teams in such a way that difference of team IQs between the strongest and the weakest team is equal to $A$.

## 입력

The first line contains integer $n$ ($1 \le n \le 100$).

The second line contains $2n$ integers, the $i$-th of which is equal to the IQ of the $i$-th student $a_i$ ($1 \le a_i \le 200$, $1 \le i \le 2n$).

## 출력

Output the minimum value $A$ for which the forming of teams is possible.

## 예제 입력 1

3
100 100 89 140 102 150


## 예제 출력 1

38