n = int(input())
arr = []
for i in range(n):
    arr.append([])
    m = int(input())
    for j in range(m):
        t, x = input().split()
        t = int(t)
        x = int(x)
        arr[-1].append((t - 1, x))
# print(arr)
taken = [[-1, -1] for i in range(11)]
dp = [0 for i in range(n)]
for i in range(len(arr)):
    if i > 0:
        dp[i] = dp[i - 1]
    for j in arr[i]:
        x, y = j
        # print(j)
        if taken[x][0] != -1 and taken[x][1] < y:
            dp[i] = max(dp[i], dp[taken[x][0]] + y - taken[x][1])
        taken[x][0] = i
        taken[x][1] = y
    # print(taken)
    # print(dp)
print(dp[n - 1])