For this Question: Pree says he stole Daenerys' dragons, and would return them to Daenerys only if she can pair the dragons in a peculiar way.
There are N (N is even) dragons, the strength of i<sup>th</sup> dragon is A<sub>i</sub>. She needs to create N/2 pairs of the dragons. The strength of the dragon pair is the sum of the strengths of dragons in the pair. She needs to pair them in such a way that the difference between the strength of dragon pair with maximum strength and the strength of the dragon pair with minimum strength is minimised. 

Now, you need to find the minimum difference in strengths if she has paired them correctly.The first line of the input contains an integer N, the number of dragons.
The second line of the input contains N integers, the strengths of the dragons.


Constraints
1 <= N <= 200000 (so many dragons, huh)
1 <= A<sub>i</sub> <= 10<sup>9</sup> for all values of i
N is divisible by 2Output a single integer, the answer to the problem.Sample Input
4
1 2 1 2

Sample Output
0

Explanation
Daenerys pairs 1st and the 2nd dragons together; the 3rd and the 4th dragon together

Sample Input
6
2 3 2 4 5 1

Sample Output
1, I have written this Solution Code: n = int(input())
bruh = input().strip().split(" ")
for i in range(len(bruh)): 
    bruh[i] = int(bruh[i])
bruh.sort()

maxSum = 0 
minSum = 100000000000000000000
for i in range(len(bruh)//2):
    add = bruh[i] + bruh[-(i+1)] 
    if add > maxSum: 
        maxSum = add
    if add < minSum: 
        minSum = add

print(maxSum - minSum), In this Programming Language: Python, Now tell me if this Code is compilable or not?