#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int arr[2 * MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; i++) scanf("%d", arr + i);
  sort(arr + 1, arr + 2 * n + 1);
  long long best = LONG_LONG_MAX;
  for (int start_x = 1; start_x <= n + 1; start_x++) {
    int r_x = arr[start_x + n - 1] - arr[start_x];
    int y_max = ((start_x == n + 1) ? arr[n] : arr[2 * n]);
    int y_min = ((start_x == 1) ? arr[n + 1] : arr[1]);
    int r_y = y_max - y_min;
    best = min(best, 1ll * r_x * r_y);
  }
  printf("%lld\n", best);
  return 0;
}
