#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using L = __int128;
void print(L x) {
	if(x < 0) {
		putchar('-');
		print(-x);
		return;
	}
	if(x >= 10)
		print(x / 10);
	putchar(x % 10 + '0');
}
ll n, a[20], b[20], p[20], ans1, pre[1000010];
L f[1000010][2], x, y, z, z2, c = -4874204890000000000000;
#define abs(x) ((x) < 0 ? -(x) : (x))
vector<int> v[110];
void solve(ll mask) {
	if(f[mask][0] > c)
		return;
	for(ll j = 0 ; j < n ; j++)
		if((mask >> j) & 1ll) {
			solve(mask - (1ll << j));
			//cout << i << " " << (1ll << j) << "\n";
			z = f[mask - (1ll << j)][0];
			z2 = f[mask - (1ll << j)][1];
			x = a[j], y = b[j];
			f[mask][0] = max({f[mask][0], z * x + abs(z) * y, z2 * x + abs(z2) * y});
			f[mask][1] = min({f[mask][1], z * x + abs(z) * y, z2 * x + abs(z2) * y});
			//if(mask == 12)
				//print(f[mask]), cout << ' ', print(z), cout << ' ', print(x), cout << ' ', print(y), cout << " j:" << j << " " << "\n";
		}
	//printf("f[%lld] = ", mask); print(f[mask]); cout << "\n";
	return;
}
int main() {
	cin >> n;
	for(int i = 0 ; i < (1 << n) ; i++)
		f[i][0] = c, f[i][1] = -c;
	for(int i = 0 ; i < n ; i++) {
		cin >> a[i] >> b[i];
	}
	if(n <= 10) {
		ll ans1 = LONG_LONG_MIN;
		for(int i = 0 ; i < n ; i++)
			p[i] = i;
		do {
			ll cnt = 1;
			for(int i = 0 ; i < n ; i++)
				cnt = a[p[i]] * cnt + b[p[i]] * abs(cnt);
			ans1 = max(ans1, cnt);
		} while(next_permutation(p, p + n));
		cout << ans1;
		exit(0);
	}
	f[0][0] = f[0][1] = 1;
	//for(int i = 1 ; i < (1 << n) ; i++)
	//cout << i << " ", print(f[i]), cout << "\n";
	solve((1ll << n) - 1);
	print(max(f[(1ll << n) - 1][1], f[(1ll << n) - 1][0]));
	//cout << to_string(solve((1ll << n) - 1));
	return 0;
}
/*
10
10 6
11 5
-8 -2
14 9
15 9
-9 -14
-11 12
-12 8
4 -9
9 5

5
-9 -14
-11 12
-12 8
4 -9
9 5
*/