#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int main() {
  int n;
  cin >> n;
  vector<long long> v(2 * n);
  for (int i = 0; i < 2 * n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long ans = (v[n - 1] - v[0]) * (v[2 * n - 1] - v[n]);
  long long minx = 1e9 + 10;
  for (int i = 0; i < n; i++) {
    long long k = v[n + i - 1] - v[i];
    minx = min(minx, k);
  }
  long long k = (v[2 * n - 1] - v[0]) * minx;
  cout << (long long)min(ans, k);
}
