# 2019 ACM NEERC, Semifinal

# Apprentice Learning Trajectory

Abigail is an apprentice studying to become a blacksmith. She wants to plan her learning trajectory and make as many swords as possible on her way to becoming a famous expert.

There are **n** masters willing to host her as their apprentice. The **i**-th master will start working at the minute `a`

and end working at the minute _{i}`b`

, working for a total of _{i}`b`

− _{i}`a`

minutes. During this interval of time, Abigail can work at this master's forge. She can enter and leave the forge several times and produce one or several swords upon each arrival. However, in order to produce a sword under supervision of the _{i}**i**-th master she has to work there for `t`

minutes in a row. She can't leave the sword unfinished and
continue working on it upon her next arrival to this forge._{i}

Help Abigail make an optimal plan and calculate the maximum number of swords she can produce under the supervision of **n** masters.

#### Input

The first line contains integer **n** (**1** ≤ **n** ≤ **200 000**) - the number of masters.
Each of the next **n** lines contains three integers `a`

, _{i}`b`

, _{i}`t`

(_{i}**1** ≤ `a`

< _{i}`a`

+ _{i}`t`

≤ _{i}`b`

≤ _{i}`10`

) - the start and the end time of master's work, and the time needed to make one sword in their forge.^{18}

#### Output

Output the maximum number of swords Abigail can produce using the optimal learning trajectory.

2 5 7 1 1 9 2

5

3 1 10 4 6 12 3 9 13 2

4

3 1 13 4 6 11 2 9 13 3

4