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