#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const double EPS = 1e-9, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using modint = ModInt<1000000000>;
template <typename T>
struct Combination {
  vector<T> _fact, _rfact, _inv;
  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for (int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for (int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for (int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }
  inline T fact(int k) const { return _fact[k]; }
  inline T rfact(int k) const { return _rfact[k]; }
  inline T inv(int k) const { return _inv[k]; }
  T P(int n, int r) const {
    if (r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }
  T C(int p, int q) const {
    if (q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
  T H(int n, int r) const {
    if (n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};
long long GCD(long long a, long long b) { return (b == 0) ? a : GCD(b, a % b); }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
long long dp[201010][15];
long long dp2[2][4][4];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  int n;
  cin >> n;
  for (int i = 0; i < (int)n + 1; ++i)
    for (int j = 0; j < (int)15; ++j) dp[i][j] = -1;
  dp[0][0] = 0;
  for (int i = 0; i < (int)n; ++i) {
    int k;
    cin >> k;
    vector<long long> c(k), d(k);
    for (int b = 0; b < (int)2; ++b)
      for (int p = 0; p < (int)4; ++p)
        for (int q = 0; q < (int)4; ++q) dp2[b][p][q] = -1;
    dp2[0][0][0] = 0;
    for (int j = 0; j < (int)k; ++j) {
      cin >> c[j] >> d[j];
      for (int b = 1; b >= 0; b--) {
        for (int p = 2; p >= 0; p--) {
          for (int q = 2; q >= 0; q--) {
            if (q + c[j] <= 3) {
              if (b == 0) {
                if (dp2[0][p][q] != -1)
                  dp2[0][p + 1][q + c[j]] =
                      max(dp2[0][p + 1][q + c[j]], dp2[0][p][q] + d[j]);
                if (dp2[0][p][q] != -1)
                  dp2[1][p + 1][q + c[j]] =
                      max(dp2[1][p + 1][q + c[j]], dp2[0][p][q] + 2 * d[j]);
              } else if (b == 1) {
                if (dp2[1][p][q] != -1)
                  dp2[1][p + 1][q + c[j]] =
                      max(dp2[1][p + 1][q + c[j]], dp2[1][p][q] + d[j]);
              }
            }
          }
        }
      }
    }
    for (int j = 0; j < (int)10; ++j) {
      if (dp[i][j] == -1) continue;
      for (int k = 0; k <= 3; k++) {
        if (j + k >= 10) {
          for (int l = 0; l <= 3; l++) {
            dp[i + 1][(j + k) % 10] =
                max(dp[i + 1][(j + k) % 10], dp[i][j] + dp2[1][k][l]);
          }
        } else {
          for (int l = 0; l <= 3; l++) {
            dp[i + 1][(j + k) % 10] =
                max(dp[i + 1][(j + k) % 10], dp[i][j] + dp2[0][k][l]);
          }
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < (int)10; ++i) ans = max(ans, dp[n][i]);
  cout << ans << endl;
  return 0;
}
