Senior, Please Buy Me Dinner!

Jeongmin, a freshman in the class of 2024, writes down every dinner promise his seniors made in a notepad. Each line of the notepad records a senior's name $S$, the promise week $W$, the day $D$, and the cost $P$ of the dinner. Names are strings, and the rest are integers. Also, no senior buys dinner more than once, and all senior names are different.

Being a computer science major, Jeongmin writes the day as an integer between $0$ and $6$. For example, Monday is $0$ and Thursday is $3$.

Kind seniors cannot back out of a dinner promise to their cute junior if they have enough money to pay for it. Looking at Jeongmin's records and the money each senior has, find the maximum number of consecutive days on which Jeongmin can get a free dinner.

The first line contains the number of records $N$. ($0 \leq N \leq 100$)

From the second line, the next $N$ lines each contain record information in the form $S$ $W$ $D$ $P$, which means senior $S$ made a dinner promise on day $D$ of week $W$ that costs $P$ won. Each senior name appears exactly once in the records. ($1 \leq W \leq 10$; $0 \leq D \leq 6$; $0 \leq P \leq 100\,000$)

Then, the next $N$ lines each contain a senior name and the money $M$ that senior has, separated by a space. The order of the names here may differ from the order in the records. ($0 \leq M \leq 100\,000$)

Each senior name is a string of up to 12 English letters, uppercase or lowercase.

Print the maximum number of consecutive days on which Jeongmin can get a free dinner.

By international standard, the week starts on Monday.