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