#include <bits/stdc++.h>
using namespace std;
vector<int> pime;
bool prime[10000010];
int trr[500100];
int sze[500100];
set<int> ste;
void initialise(int n) {
  for (int i = 0; i < n; ++i) {
    trr[i] = i;
    sze[i] = 1;
  }
}
int root(int x) {
  while (trr[x] != x) {
    trr[x] = trr[trr[x]];
    x = trr[x];
  }
  return x;
}
void join(int x, int y) {
  int rx = root(x);
  int ry = root(y);
  if (rx == ry) {
    return;
  }
  if (sze[rx] > sze[ry]) {
    sze[rx] += sze[ry];
    trr[ry] = rx;
    ste.insert(-sze[rx]);
  } else {
    sze[ry] += sze[rx];
    trr[rx] = ry;
    ste.insert(-sze[ry]);
  }
}
void sieve() {
  memset(prime, true, sizeof(prime));
  prime[0] = false;
  prime[1] = false;
  for (int i = 2; i * i <= 10000000; i++) {
    if (prime[i]) {
      for (int j = 2 * i; j <= 10000000; j += i) {
        prime[j] = false;
      }
    }
  }
  for (int i = 0; i < 10000001; ++i) {
    if (prime[i]) {
      pime.push_back(prime[i]);
    }
  }
}
long long int modexpo(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
    }
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long int expo(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) {
      res = (res * a);
    }
    a = (a * a);
    b >>= 1;
  }
  return res;
}
long long int __gcd(long long int a, long long int b) {
  if (a == 0) {
    return b;
  }
  return __gcd(b % a, a);
}
bool isPrime(long long int n) {
  if (n <= 1) {
    return false;
  }
  if (n <= 3) {
    return true;
  }
  if (n % 2 == 0 || n % 3 == 0) {
    return false;
  }
  for (int i = 5; i * i <= n; i += 6) {
    if ((n % i == 0) || (n % (i + 2) == 0)) {
      return false;
    }
  }
  return true;
}
long long int dist(long long int x1, long long int y1, long long int x2,
                   long long int y2) {
  return (long long int)sqrt(
      (long double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
long long int squaredist(long long int x1, long long int y1, long long int x2,
                         long long int y2) {
  return ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
long long int nCr(long long int n, long long int r) {
  if (r == 0) {
    return 1;
  }
  return (n * nCr(n - 1, r - 1)) / r;
}
bool vow(char ch) {
  if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
    return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  ;
  long long int arr[2 * n];
  for (int i = 0; i < 2 * n; ++i) {
    cin >> arr[i];
    ;
  }
  sort(arr, arr + 2 * n);
  long long int ans = (arr[n - 1] - arr[0]) * (arr[2 * n - 1] - arr[n]);
  for (int i = 1; i < n; ++i) {
    long long int val = (arr[i + n - 1] - arr[i]) * (arr[2 * n - 1] - arr[0]);
    ans = min(ans, val);
  }
  cout << ans;
  ;
  cout << '\n';
  return 0;
}
