#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::string;
using std::vector;
int main() {
  size_t n;
  cin >> n;
  std::vector<int> vec(2 * n);
  for (size_t i = 0; i != 2 * n; ++i) {
    cin >> vec[i];
  }
  std::sort(vec.begin(), vec.end());
  std::vector<long long> pfx(n + 1);
  for (size_t i = 0; i != n + 1; ++i) {
    pfx[i] = vec[n + i - 1] - vec[i];
  }
  long long min = pfx[0] * pfx[n];
  for (size_t i = 1; i != n; ++i) {
    if (pfx[i] * (vec[vec.size() - 1] - vec[0]) < min) {
      min = pfx[i] * (vec[vec.size() - 1] - vec[0]);
    }
  }
  cout << min << "\n";
}
