#include <bits/stdc++.h>
const int MAXN = 100000 + 10;
const int INF = 0x7f3f3f3f;
int Read() {
  char ch;
  while (((ch = getchar()) < '0' || '9' < ch) && ch != '-')
    ;
  char tmp = ch - '0';
  int ans = 0;
  if (tmp != '-') ans = ch - '0';
  while ('0' <= (ch = getchar()) && ch <= '9') ans = ans * 10 + ch - '0';
  if (tmp == '-') return -ans;
  return ans;
}
int n;
int k;
int a[MAXN * 2];
int main() {
  n = Read();
  for (int i = 1; i <= 2 * n; ++i) a[i] = Read();
  std::sort(a + 1, a + 1 + n * 2);
  int x_1 = a[n] - a[1];
  int y_1 = a[n * 2] - a[n + 1];
  long long ans = x_1 * 1LL * y_1;
  int x_2 = a[n * 2] - a[1];
  int y_2 = INF;
  for (int i = 2; i <= n; ++i) y_2 = std::min(y_2, a[i + n - 1] - a[i]);
  ans = std::min(ans, x_2 * 1LL * y_2);
  std::cout << ans << std::endl;
  return 0;
}
