#include <bits/stdc++.h>
using namespace std;
int a[2 * 100000];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort(a, a + 2 * n);
  long long ans = (a[n - 1] - a[0]) * 1LL * (a[2 * n - 1] - a[n]);
  for (int i = 1; i < n; i++) {
    ans = min(ans, (a[i + (n - 1)] - a[i]) * 1LL * (a[2 * n - 1] - a[0]));
  }
  printf("%lld\n", ans);
  return 0;
}
