Locust Locus

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제

There are two different species of periodical cicadas that only appear from hibernation every 1313 and 1717 years, respectively. Your old grandpa tells you that he saw them simultaneously back in '92.  You start pondering how many years you have to wait until you see them again.  You collect information about other pairs of periodical cicadas and when they were last observed to find out when the next simultaneous appearance is.

Given several different pairs of cicadas and their last simultaneous appearance, find the next year that one of the pairs reappears.

입력

The first line of input contains a single integer kk (1k991 \le k \le 99), the number of pairs of periodical cicadas.  Then follow kk lines, each containing three integers yy, c_1c\_1 and c_2c\_2 (1800y20211800 \le y \le 2021, 1c_1,c_2991 \le c\_1, c\_2 \le 99), the year this pair was last observed and cycle lengths for the first and second species, respectively. You may assume that none of the kk pairs reappears earlier than 20222022.

출력

Output the first year a pair reappears.