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