#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int i, n;
  cin >> n;
  n = 2 * n;
  vector<long long int> point;
  for (i = 0; i < n; i++) {
    long long int input;
    cin >> input;
    point.push_back(input);
  }
  sort(point.begin(), point.end());
  long long int dx = point[(n - 1) / 2] - point[0];
  long long int dy = point[n - 1] - point[((n - 1) / 2) + 1];
  long long int ans = dx * dy;
  for (i = 1; i < n / 2; i++) {
    dy = point[n - 1] - point[0];
    dx = point[i + n / 2 - 1] - point[i];
    if (dx * dy < ans) ans = dx * dy;
  }
  cout << ans;
  return 0;
}
