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