using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        List<List<Tuple<int, int>>> list = new List<List<Tuple<int, int>>>();
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            
            for (int i = 0; i < n; i++)
            {
                var a = cin.nextInt();
                var item = new List<Tuple<int, int>>();
                for (int j = 0; j < a; j++)
                {
                    var p = cin.nextInt();
                    var s = cin.nextInt();
                    item.Add(Tuple.Create(p, s));
                }
                list.Add(item);
            }

            var ans = 0;
            for (int bit = 0; bit < (1 << n); bit++)
            {
                var hCount = 0;
                for (int i = 0; i < n; i++)
                    if ((bit & (1 << i)) > 0) hCount++;                

                if (honest(bit)) ans = Math.Max(ans, hCount);
            }

            Console.WriteLine(ans);            
        }

        bool honest(int bit)
        {
            var j = 0;
            foreach (var ss in list)
            {
                if (!((bit & (1 << j)) > 0))
                {
                    j++;
                    continue;
                };

                foreach (var item in ss)
                {
                    var p = item.Item1 - 1;
                    var s = item.Item2;

                    //p==s?
                    if ((bit & (1 << p)) > 0 && s == 0) return false;
                    if (!((bit & (1 << p)) > 0) && s == 1) return false;
                }
                j++;
            }

            return true;
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 13268