#include <bits/stdc++.h>
using namespace std;
long long int n, a[200005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (long long int i = 1; i <= 2 * n; ++i) cin >> a[i];
  sort(a + 1, a + 2 * n + 1);
  long long int ans = (a[n] - a[1]) * (a[2 * n] - a[n + 1]);
  for (long long int i = 2; i <= n; ++i) {
    ans = min(ans, (a[i + n - 1] - a[i]) * (a[2 * n] - a[1]));
    ans = min(ans, (a[2 * n] - a[i]) * (a[n + 1] - a[1]));
  }
  cout << ans << '\n';
}
