#include <bits/stdc++.h>
using namespace std;
long long ar[200005];
long long N;
int main() {
  cin >> N;
  for (long long i = 0; i < 2 * N; i++) {
    cin >> ar[i];
  }
  sort(ar, ar + 2 * N);
  long long x = ar[0];
  long long y = ar[2 * N - 1];
  long long ans = (ar[N - 1] - x) * (y - ar[N]);
  for (int i = 1; i <= N; i++) {
    ans = min(ans, (ar[2 * N - 1] - ar[0]) * (ar[i + N - 1] - ar[i]));
  }
  cout << ans << endl;
  return (0);
}
