#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long int n, i;
  cin >> n;
  long long int a[2 * n + 1];
  for (i = 1; i <= 2 * n; i++) cin >> a[i];
  sort(a + 1, a + 2 * n + 1);
  long long int x1, y1, x2, y2;
  x1 = a[1];
  y1 = a[n + 1];
  x2 = a[n];
  y2 = a[2 * n];
  long long int ans = (y2 - y1) * (x2 - x1);
  for (i = 2; i <= n; i++)
    ans = min(ans, (a[2 * n] - a[1]) * (a[i + n - 1] - a[i]));
  cout << ans;
}
