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