#include <bits/stdc++.h>
int n, a[200010];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n * 2; i++) scanf("%d", a + i);
  std::sort(a, a + n * 2);
  long long ans = (a[n - 1] - a[0]) * 1ll * (a[n * 2 - 1] - a[n]), tmp;
  for (int i = 0; i < n; i++)
    if ((tmp = (a[n * 2 - 1] - a[0]) * 1ll * (a[i + n] - a[i + 1])) < ans)
      ans = tmp;
  printf("%lld\n", ans);
  return 0;
}
