#include <iostream>
using namespace std;

int N;
int A[16], B[16], K[16], L[16];
int visited; // 비트
int val, mx;
void func(int cnt) {
	if (cnt == N) {
		mx = max(mx, val);
		return;
	}
	int nxt = -1, nxtmn = 1000000007;
	for (int i = 0; i < N; i++) {
		if (visited & (1 << i)) continue;
		if ((visited & K[i]) == K[i]) {
			if (L[i]) {
				visited ^= (1 << i);
				val += (cnt + 1) * B[i];
				func(cnt + 1);
				val -= (cnt + 1) * B[i];
				visited ^= (1 << i);
			}
			else if (nxtmn > B[i]) nxtmn = B[i], nxt = i;
		}
	}

	if (nxt > -1) {
		int i = nxt;
		visited ^= (1 << i);
		val += (cnt + 1) * B[i];
		func(cnt + 1);
		val -= (cnt + 1) * B[i];
		visited ^= (1 << i);
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> N;
	for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
	for (int i = 0; i < N; i++) {
		for (int j = i + 1; j < N; j++) {
			if (A[j] % A[i] == 0) K[j] |= (1 << i), L[i] |= (1 << j);
		}
	}

	func(0);
	cout << mx;
}