문제<\/h2>
Faina is going to sleep, but she needs to wake up early tomorrow for a very important contest. She has already set $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> alarms at different times between 7:00 and 9:00 in the morning.<\/p> However, Faina is a deep sleeper. She knows that in order to wake up, she will need to hear at least three alarms within a 10-minute timespan. In other words, for some three alarms, the difference between the first and the last alarm must be 10 minutes or less.<\/p> Faina is not sure if the current set of alarms she has satisfies this condition, and she is worried she might oversleep the contest (and make her teammates angry!). Thus, she wants to set some additional alarms. All new alarms should also be set between 7:00 and 9:00, and all alarms, including the old ones, must be set at different times.<\/p> Find the smallest number of additional alarms Faina has to set to be confident that she will wake up. In particular, if she can already be sure she'll wake up, the number of additional alarms is 0<\/mn><\/mrow>0<\/math><\/span><\/span> 0<\/span><\/span><\/span><\/span>.<\/p> 입력<\/h2> The first line contains a single integer n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span>, denoting the number of alarms Faina has set (1<\/mn>\leq<\/mo>n<\/mi>\leq<\/mo>20<\/mn><\/mrow>1 \le n \le 20<\/math><\/span><\/span> 1<\/span> <\/span> \leq<\/span> <\/span><\/span> <\/span> n<\/span> <\/span> \leq<\/span> <\/span><\/span>$

False Alarm