Don't Be Fake

DontBeFake is an app that sends each user a notification at a random moment. The user then has to photograph what they are doing at that exact moment.

You have $N$ friends on DontBeFake. Each friend has a set of time intervals $[L, R]$ when they are available. If a friend gets a notification at second $s$ and $s$ falls inside one of their available intervals, they take a picture, and you get to view it. The app and taking a picture are both slow, so a friend who becomes available only one second after $s$ does not have time to take the picture.

All friends live in the same time zone and get one notification at exactly the same time of day. All times are seconds from midnight.

Find the maximum number of pictures you can view in the day, over all seconds when the notification can arrive. Also find how many different seconds the notification could arrive at so that the maximum number of pictures is taken.

The first line contains an integer $N$ ($1 \leq N \leq 50$). Each of the next $N$ lines describes the available intervals of one friend. Each such line starts with an integer $M$ ($1 \leq M \leq 10$), followed by $M$ pairs of integers $L_i$, $R_i$ ($L_i \leq R_i$). This means the friend is available from second $L_i$ to second $R_i$, inclusive.

It is guaranteed that $R_i < L_{i+1}$ for all $1 \leq i < M$, so the intervals do not overlap. It is also guaranteed that $0 \leq L_i, R_i < 86\,400$.

On the first line, print the maximum number of pictures you can view in the day. On the second line, print the total number of seconds at which the notification could arrive for the maximum number of pictures to be taken.