#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b) {
    return a;
  }
  return b;
}
int main() {
  int n;
  long long int x;
  cin >> n;
  vector<long long int> v;
  for (int i = 0; i < 2 * n; i++) {
    cin >> x;
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  x = (v[n - 1] - v[0]) * (v[2 * n - 1] - v[n]);
  for (int i = n; i < 2 * n; i++) {
    x = min(x, (v[2 * n - 1] - v[0]) * (v[i] - v[i + 1 - n]));
  }
  cout << x << endl;
}
