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