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