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