#include <bits/stdc++.h>
using namespace std;
int n;
int num[100001];
vector<int> vList;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  int coord;
  for (int i = 0; i < 2 * n; i++) {
    cin >> coord;
    vList.push_back(coord);
  }
  sort(vList.begin(), vList.end());
  long long res = (long long)(vList[n - 1] - vList[0]) *
                  (long long)(vList[2 * n - 1] - vList[n]);
  for (int i = 1; i < n; i++) {
    res = min(res, (long long)(vList[n - 1 + i] - vList[i]) *
                       (long long)(vList[2 * n - 1] - vList[0]));
  }
  cout << res;
}
