#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
 
using namespace std;
 
int min_sum(vector<int>array1,vector<int>array2){
    int n=array1.size();
    sort(array1.begin(),array1.end(),greater<int>());
    sort(array2.begin(),array2.end());
 
    int result=0;
    for(int i=0;i<n;i++){
        result+=array1[i]*array2[i];
    }
 
    return result;
}
 
 
 
 
 
int main(){
    int n;
    cin>>n;
    vector<int>array1(n);
    vector<int>array2(n);
    for(int i=0;i<n;i++){
        cin>>array1[i];
        cin>>array2[i];
    }
 
    int ans;
    ans=min_sum(array1,array2);
    cout<<"Minimum sum from the 2 arrays' product : "<<ans<<endl;
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGZ1bmN0aW9uYWw+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1pbl9zdW0odmVjdG9yPGludD5hcnJheTEsdmVjdG9yPGludD5hcnJheTIpewogICAgaW50IG49YXJyYXkxLnNpemUoKTsKICAgIHNvcnQoYXJyYXkxLmJlZ2luKCksYXJyYXkxLmVuZCgpLGdyZWF0ZXI8aW50PigpKTsKICAgIHNvcnQoYXJyYXkyLmJlZ2luKCksYXJyYXkyLmVuZCgpKTsKCiAgICBpbnQgcmVzdWx0PTA7CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKXsKICAgICAgICByZXN1bHQrPWFycmF5MVtpXSphcnJheTJbaV07CiAgICB9CgogICAgcmV0dXJuIHJlc3VsdDsKfQoKCgoKCmludCBtYWluKCl7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgIHZlY3RvcjxpbnQ+YXJyYXkxKG4pOwogICAgdmVjdG9yPGludD5hcnJheTIobik7CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKXsKICAgICAgICBjaW4+PmFycmF5MVtpXTsKICAgICAgICBjaW4+PmFycmF5MltpXTsKICAgIH0KCiAgICBpbnQgYW5zOwogICAgYW5zPW1pbl9zdW0oYXJyYXkxLGFycmF5Mik7CiAgICBjb3V0PDwiTWluaW11bSBzdW0gZnJvbSB0aGUgMiBhcnJheXMnIHByb2R1Y3QgOiAiPDxhbnM8PGVuZGw7CiAgICByZXR1cm4gMDsKfQ==

NQoxIDIgLTIgLTEgLTQKOSAyIDEgLTUgLTM=

5
1 2 -2 -1 -4
9 2 1 -5 -3