#include <bits/stdc++.h>
using namespace std;
int const N = 1e5 + 7;
long long n, a[2 * N], ans;
int main() {
  ios_base ::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + 2 * n + 1);
  ans = (a[n] - a[1]) * (a[n * 2] - a[n + 1]);
  for (int i = 2; i <= n; i++) {
    ans = min(ans, (a[n * 2] - a[1]) * (a[i + n - 1] - a[i]));
  }
  cout << ans << endl;
  return 0;
}
