#include <bits/stdc++.h>
using namespace std;
long long a[200020];
int main() {
  long long n, nn, i, res, tp;
  cin >> n;
  if (n == 1) {
    cout << "0\n";
    return 0;
  }
  nn = 2 * n;
  for (i = 0; i < nn; i++) {
    scanf("%d", a + i);
  }
  sort(a, a + nn);
  res = (a[nn - 1] - a[nn / 2]) * (a[nn / 2 - 1] - a[0]);
  for (i = 1; i < n; i++) {
    tp = (a[nn - 1] - a[0]) * (a[nn / 2 - 1 + i] - a[i]);
    res = min(res, tp);
  }
  cout << res << endl;
  return 0;
}
