#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N;
ll ans = 0;
ll mod = 1000000007;

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++) {
		ll C, D;
		cin >> C >> D;
		if (C == 1 || C == 2) {
			ans += D;
			ans %= mod;
		}
		else if (C == 3) {
			ans += D * 2;
			ans %= mod;
		}
		else {
			if (C % 2 != 0) {
				ans += ((C / 3 + 1) % mod)*(D%mod);
			}
			else {
				ans += ((C / 3 + 2) % mod)*(D%mod);
			}
		}
	}
		cout << ans << endl;
	return 0;
}