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