#include <bits/stdc++.h>
using namespace std;
int N, a[200003];
int main() {
  cin >> N;
  for (int i = 0; i < (2 * N); i++) cin >> a[i];
  sort(a, a + (2 * N));
  if (N == 1) {
    cout << "0\n";
    return 0;
  }
  long long x = LONG_LONG_MAX;
  for (int i = 1; i < N; i++) x = min(x, 1LL * a[i + N - 1] - a[i]);
  cout << min((a[2 * N - 1] - a[0]) * x,
              1LL * (a[N - 1] - a[0]) * (a[2 * N - 1] - a[N]));
  return 0;
}
