#include<bits/stdc++.h>
#define int __int128
#define il inline
namespace things{
	il int rd(){
		int f = 1, x = 0;
		char ch = getchar();
		while(ch < '0' || ch > '9'){
			if (ch == '-' ) f = -1;
			ch = getchar();
		}
		while(ch >= '0' && ch <= '9'){
			x = x * 10 + ch - '0';
			ch = getchar();
		}
		return x * f;
	}
	il void wt(int x){
		if (x < 0){
			putchar('-');
			x = -x;
		}
		if (x > 9) wt(x / 10);
		putchar(x % 10 + '0');
		return;
	}
	il int max(int x, int y){
		return std::max(x, y);
	}
	il int min(int a, int b){
		return std::min(a, b);
	}
}
using namespace things;
using namespace std;

const int N = 20;
int n, a[N], b[N], f[1 << N][2];

int calc(int x, int i){
	return a[i] * x + b[i] * ((x < 0) ? (-x) : x);
}

signed main(){
	n = rd();
	for (int i = 1; i <= n; i++){
		a[i] = rd(), b[i] = rd();
	}
	f[0][0] = f[0][1] = 1;
	for (int i = 1; i < (1 << n); i++){
		f[i][0] = 1e25;
		f[i][1] = -1e25;
	}
	for (int i = 1; i < (1 << n); i++){
		for (int j = 1; j <= n; j++){
			if (i & (1 << (j - 1))){
				f[i][0] = min(min(f[i][0], calc(f[i - (1 << (j - 1))][0], j)), calc(f[i - (1 << (j - 1))][1], j));
				f[i][1] = max(max(f[i][1], calc(f[i - (1 << (j - 1))][0], j)), calc(f[i - (1 << (j - 1))][1], j));
			}
		}
	}
	wt(f[(1 << n) - 1][1]);
	return 0;
}