#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, a[200010], bs;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie();
  cin >> n;
  for (i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort(a, a + 2 * n);
  bs = (a[n - 1] - a[0]) * (a[2 * n - 1] - a[n]);
  for (i = 1; i + n < 2 * n; i++) {
    bs = min(bs, (a[i + n - 1] - a[i]) * (a[2 * n - 1] - a[0]));
  }
  cout << bs << endl;
  return 0;
}
