#include <bits/stdc++.h>
#define int unsigned long long
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair < int, int > ii;
const int maxn = 5e3+10, inf = 3e18;
int n, dp[maxn];
map < int, int > mapa;
int32_t main()
{
cin >> n;
for(int i = 1 ; i <= n ; i++)
{
int32_t xk, yk;
cin >> xk >> yk;
int x = (int)abs(xk+xk);
int y = (int)abs(yk+yk);
if(!mapa.count(x)) mapa[x] = y;
else mapa[x] = max(mapa[x], y);
}
vector < ii > aux;
for(auto v : mapa)
{
if(!aux.size() or aux[aux.size()-1].S > v.S) aux.pb(v);
else if(aux.size())
{
aux.pop_back();
aux.pb(v);
}
}
//reverse(aux.begin(), aux.end());
/*for(int i = 0 ; i < aux.size() ; i++)
{
cout << aux[i].F << ' ' << aux[i].S << "\n";
}*/
dp[1] = 0;
for(int i = 1 ; i < aux.size() ; i++)
{
dp[i+1] = inf;
for(int j = 0 ; j < i ; j++)
{
dp[i+1] = min(dp[i+1], dp[j+1] + aux[j].S*aux[i-1].F);
}
}
int resp = inf;
for(int i = 0 ; i < aux.size() ; i++)
{
resp = min(resp, dp[i+1] + aux[i].S*aux[aux.size()-1].F);
}
cout << resp << "\n";
}
