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