#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> pct[200001];
long long n, v[200001], ans = 1000000000000000010, k;
map<long long, long long> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> v[i];
  sort(v + 1, v + 2 * n + 1);
  k = n;
  ans = (v[k] - v[1]) * (v[k * 2] - v[k + 1]);
  for (int i = 1; i < k; i++)
    if ((v[k + i] - v[i + 1]) * (v[k * 2] - v[1]) < ans)
      ans = (v[k + i] - v[i + 1]) * (v[k * 2] - v[1]);
  cout << ans << endl;
  return 0;
}
