#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, x;
  cin >> n;
  long long int a[2 * n];
  long long int ans;
  for (long long int i = 0; i < n * 2; i++) cin >> a[i];
  sort(a, a + 2 * n);
  ans = (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0]);
  for (long long int i = 1; i < n; i++)
    ans = min(ans, (a[2 * n - 1] - a[0]) * (a[n + i - 1] - a[i]));
  cout << ans;
}
int main() {
  long long int test;
  test = 1;
  while (test--) {
    solve();
  }
  return 0;
}
