#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

int main() {
  int K;
  cin >> K;
  vector<int> D(K);
  vector<int> L(K);

  for (int i = 0; i < K; i++) {
    cin >> D[i] >> L[i];
  }

  vector<int> mod7 = {1, 3, 2, 6, 4, 5};
  ll dp[6][7];
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;

  for (int i = K - 1; i >= 0; --i) {
    ll temp[6][7];
    memcpy(temp, dp, sizeof(dp));

    int d = D[i];
    int l = L[i];
    for (int j = 0; j < 6; ++j) {
      ll sum = 0;
      for (int k = 0; k < l % 6; ++k) {
        sum += mod7[(j + k) % 6] * d;
      }
      for (int k = 0; k < 7; ++k) {
        temp[(j + l) % 6][(k + sum) % 7] += dp[j][k];
      }
    }

    memcpy(dp, temp, sizeof(dp));
  }

  ll ans = 0;
  for (int i = 0; i < 6; ++i) {
    for (int j = 0; j < 7; ++j) {
      ans += dp[i][j] * j;
      ans %= MOD;
    }
  }

  cout << ans << endl;

  return 0;
}