#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  vector<long long> a(2 * n);
  for (long long i = 0; i < 2 * n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  if (n == 1) {
    cout << 0;
    return 0;
  }
  long long mn = 2e9;
  for (long long i = 1; i < n; ++i) {
    mn = min(a[i + n - 1] - a[i], mn);
  }
  cout << min(min((a[n - 1] - a[0]) * (a[2 * n - 1] - a[n]),
                  (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0])),
              mn * (a[2 * n - 1] - a[0]));
  return 0;
}
