#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
int n;
long long int arr[N];
long long int res;
int main() {
  res = 1e18 + 200;
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) {
    cin >> arr[i];
  }
  sort(arr + 1, arr + 2 * n + 1);
  for (int i = n; i <= 2 * n; i++) {
    if (i == n) {
      res = min(res, (arr[i] - arr[i - n + 1]) * (arr[n * 2] - arr[n + 1]));
    } else if (i == 2 * n) {
      res = min(res, (arr[i] - arr[i - n + 1]) * (arr[n] - arr[1]));
    } else {
      res = min(res, (arr[i] - arr[i - n + 1]) * (arr[n * 2] - arr[1]));
    }
  }
  cout << res << endl;
  return 0;
}
