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