import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main {
    static final long MOD = 1_000_000_007 , INF = 1_000_000_000_000_000_000L;
    static final int INf = 1_000_000_000;
    static FastReader reader;
    static PrintWriter writer;
    public static void main(String[] args) {
        Thread t = new Thread(null, new O(), "Integer.MAX_VALUE", 100000000);
        t.start();
    }
    static class O implements Runnable {
        public void run() {
            try {
                magic();
            }
            catch (Exception e) {
                e.printStackTrace();
                System.exit(1);
            }
        }
    }
    static class FastReader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public FastReader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public FastReader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[1000000];
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg) return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ') c = read();
            boolean neg = (c == '-');
            if (neg) c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
            if (neg) return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1) buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead) fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null) return;
            din.close();
        }
    }
    static int nturns, cost[][], damage[][], smaller_sum[],sum, sz_turn[];
    static long dp[][][];
    static void magic() throws IOException {
        reader = new FastReader();
        writer = new PrintWriter(System.out, true);
        nturns = reader.nextInt();
        cost = new int[nturns][];
        damage = new int[nturns][];
        smaller_sum = new int[nturns];
        sz_turn = new int[nturns];
        sum = 0;
        for(int i=0;i<nturns;++i) {
            int len = reader.nextInt();
            sz_turn[i] = len;
            cost[i] = new int[len];
            damage[i] = new int[len];
            for(int j=0;j<len;++j) {
                cost[i][j] = reader.nextInt();
                damage[i][j] = reader.nextInt();
            }
            smaller_sum[i] = sum;
            sum+=len;
        }
        dp = new long[sum][4][11];
        for(int i=0;i<sum;++i) {
            for(int j=0;j<4;++j) {
                for(int k=0;k<11;++k) {
                    dp[i][j][k] = -1;
                }
            }
        }
        writer.println(f(0,0,0,1));
    }
    static long f(int turn, int pos_in_turn, int is_turn_ka_cost, int pos_mod_10) {
        if(pos_in_turn==sz_turn[turn]) {
            turn++;
            pos_in_turn = 0;
            is_turn_ka_cost = 0;
        }
        if(turn==nturns) {
            return 0;
        }
        int iska_pos = smaller_sum[turn] + pos_in_turn;
        if(dp[iska_pos][is_turn_ka_cost][pos_mod_10]!=-1) {
            return dp[iska_pos][is_turn_ka_cost][pos_mod_10];
        }
        long max = 0;
        //leke
        if(is_turn_ka_cost+cost[turn][pos_in_turn]<=3) {
            long ispe = (pos_mod_10==10 ? 2*damage[turn][pos_in_turn] : damage[turn][pos_in_turn]) + f(turn, pos_in_turn+1, is_turn_ka_cost+cost[turn][pos_in_turn], (pos_mod_10+1==11 ? 1 : pos_mod_10+1));
            max = max(max, ispe);
        }
        //na leke
        max = max(max, f(turn, pos_in_turn+1, is_turn_ka_cost, pos_mod_10));
        return dp[iska_pos][is_turn_ka_cost][pos_mod_10] = max;
    }
}