#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const long long inf = 1e9;
const int MAXM = 1048800;
const int MAXN = 1e7 + 1;
bool visit[MAXM];
int a[MAXM];
int k;
vector<int> v;
int main() {
  int n, i, j, k;
  cin >> n;
  n *= 2;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int ans = INT_MAX, cnt = 0;
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      v.clear();
      cnt = 0;
      for (int k = 0; k < n; k++) {
        if (k == i or k == j) continue;
        v.push_back(a[k]);
      }
      int nn = v.size();
      for (int k = 0; k < nn; k += 2) {
        cnt += v[k + 1] - v[k];
      }
      ans = min(ans, cnt);
    }
  }
  cout << ans << endl;
  return 0;
}
