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