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