#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n;
  cin >> n;
  vector<long long> v(2 * n, 0);
  for (long long i = 0; i < 2 * n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long x1 = v[2 * n - 1];
  long long y1 = v[0];
  long long x2 = v[n];
  long long y2 = v[n - 1];
  long long a1 = abs(x1 - x2) * abs(y1 - y2);
  long long small = v[0], large = v[2 * n - 1];
  v.erase(v.begin());
  v.erase(--v.end());
  int mind = numeric_limits<int>::max();
  for (int i = 0; i < n - 1; i++) {
    int diff = v[i + n - 1] - v[i];
    mind = min(diff, mind);
  }
  long long a2 = (large - small) * mind;
  cout << min(a1, a2) << endl;
}
