F - Kayaking CodeForces - 863B

Vadim is really keen on travelling. Recently he heard about kayaking activity near his town and became very excited about it, so he joined a party of kayakers.

Now the party is ready to start its journey, but firstly they have to choose kayaks. There are 2·n people in the group (including Vadim), and they have exactly n - 1 tandem kayaks (each of which, obviously, can carry two people) and 2 single kayaks. i-th person's weight is w_i, and weight is an important matter in kayaking — if the difference between the weights of two people that sit in the same tandem kayak is too large, then it can crash. And, of course, people want to distribute their seats in kayaks in order to minimize the chances that kayaks will crash.

Formally, the instability of a single kayak is always 0, and the instability of a tandem kayak is the absolute difference between weights of the people that are in this kayak. Instability of the whole journey is the total instability of all kayaks.

Help the party to determine minimum possible total instability!

Input

The first line contains one number n (2 ≤ n ≤ 50).

The second line contains 2·n integer numbers w₁, w₂, ..., w_2n, where w_i is weight of person i (1 ≤ w_i ≤ 1000).

Output

Print minimum possible total instability.

Example

Input

2
1 2 3 4

Output

1

Input

4
1 3 4 6 3 4 100 200

Output

5

排序后遍历当k不等于i  j时（i j表示乘单人船的两个人的下标）求两相邻数的差值和ans。再min（）求最小的ans。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000];
int b[1000];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        int m=2*n;
        for(int i=1;i<=m;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+m+1);//排序。一个数的最小差值肯定离自己最近
        int sum=999999;
        for(int i=1;i<m;i++)
        {
            for(int j=i+1;j<=m;j++)
            {
                int x=0;
                int ans=0;
                for(int k=1;k<=m;k++)
                {
                    if(k!=i&&k!=j)//i j作为单人船
                    {
                        b[x++]=a[k];
                        if(x%2==0)
                        ans+=abs(b[x-1]-b[x-2]);
                    }
                }
               sum=min(sum,ans);
            }
        }
        printf("%d\n",sum);
    }
}