#include<bits/stdc++.h>
using namespace std;
int solve(int arr[],int i,int j,int temp)
{
	int val=0;
	vector<int> vec;
	for(int k=0;k<temp;k++)
	{
		if(k!=i&&k!=j)
			vec.push_back(arr[k]);
	}
	for(int k=0;k<vec.size();)
	{
		val = val + abs(vec[k]-vec[k+1]);
		k+=2;
	}
	return val;
}
int main()
{
	int n;
	cin>>n;
	int temp = 2*n;
	int arr[2*n];
	for(int i=0;i<2*n;i++)
		cin>>arr[i];
	sort(arr,arr+temp);
	int ans=INT_MAX;
	for(int i=0;i<temp;i++)
	{
		for(int j=i+1;j<temp;j++)
		{
			ans = min(solve(arr,i,j,temp),ans);
		}
	}
	cout<<ans;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IHNvbHZlKGludCBhcnJbXSxpbnQgaSxpbnQgaixpbnQgdGVtcCkKewoJaW50IHZhbD0wOwoJdmVjdG9yPGludD4gdmVjOwoJZm9yKGludCBrPTA7azx0ZW1wO2srKykKCXsKCQlpZihrIT1pJiZrIT1qKQoJCQl2ZWMucHVzaF9iYWNrKGFycltrXSk7Cgl9Cglmb3IoaW50IGs9MDtrPHZlYy5zaXplKCk7KQoJewoJCXZhbCA9IHZhbCArIGFicyh2ZWNba10tdmVjW2srMV0pOwoJCWsrPTI7Cgl9CglyZXR1cm4gdmFsOwp9CmludCBtYWluKCkKewoJaW50IG47CgljaW4+Pm47CglpbnQgdGVtcCA9IDIqbjsKCWludCBhcnJbMipuXTsKCWZvcihpbnQgaT0wO2k8MipuO2krKykKCQljaW4+PmFycltpXTsKCXNvcnQoYXJyLGFycit0ZW1wKTsKCWludCBhbnM9SU5UX01BWDsKCWZvcihpbnQgaT0wO2k8dGVtcDtpKyspCgl7CgkJZm9yKGludCBqPWkrMTtqPHRlbXA7aisrKQoJCXsKCQkJYW5zID0gbWluKHNvbHZlKGFycixpLGosdGVtcCksYW5zKTsKCQl9Cgl9Cgljb3V0PDxhbnM7Cn0=

NAoxIDMgNCA2IDMgNCAxMDAgMjAw

4
1 3 4 6 3 4 100 200