#include <bits/stdc++.h>
using namespace std;
long long inf = 2147483647;
const long long ll = 9223372036854775807, ninf = 1000000000;
const double eps = 1e-6;
const long long nll = 1000000000000000000;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int a;
  while (cin >> a) {
    vector<long long> A;
    for (int i = 0; i < 2 * a; i++) {
      int x;
      cin >> x;
      A.push_back(x);
    }
    map<long long, long long> num;
    sort(A.begin(), A.end());
    int ok = 0;
    for (int i = 0; i < A.size(); i++) {
      num[A[i]]++;
      if (num[A[i]] >= a) {
        ok = 1;
      }
    }
    if (ok) {
      cout << 0 << '\n';
      continue;
    }
    long long l = A[a - 1] - A[0];
    long long r = A[2 * a - 1] - A[a];
    ;
    long long ans = l * r;
    long long t = A[2 * a - 1];
    int n = a - 1;
    for (int i = 2 * a - 2; i >= 0; i--) {
      if (i - n < 0) break;
      ans = min(ans, (A[i] - A[i - n]) * (t - A[0]));
    }
    cout << ans << '\n';
  }
  return 0;
}
