#include <bits/stdc++.h>
using namespace std;
int ar[200010];
int main(int argc, char const *argv[]) {
  int n;
  scanf("%d", &n);
  n = 2 * n;
  for (int i = 0; i < n; i++) {
    scanf("%d", ar + i);
  }
  sort(ar, ar + n);
  long long ans = LLONG_MAX;
  ans = min(ans, 1ll * (ar[n / 2 - 1] - ar[0]) * (ar[n - 1] - ar[n / 2]));
  for (int i = 1; i < n / 2; i++) {
    ans = min(ans, 1ll * (ar[i + n / 2 - 1] - ar[i]) * (ar[n - 1] - ar[0]));
  }
  cout << ans;
  return 0;
}
