#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int>>,
                       greater<pair<int, int>>>
    rpqpi;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<long long> a(2 * n);
  for (int i = 0; i < 2 * n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  if (n == 1) {
    cout << 0 << '\n';
  } else {
    long long ans = (a[n - 1] - a[0]) * (a[2 * n - 1] - a[n]);
    for (int i = n; i < 2 * n - 1; ++i) {
      if ((a[i] - a[i - n + 1]) * (a[2 * n - 1] - a[0]) < ans) {
        ans = (a[i] - a[i - n + 1]) * (a[2 * n - 1] - a[0]);
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
