CF662E To Hack or not to Hack

Consider a regular Codeforces round consisting of three problems that uses dynamic scoring. You are given an almost final scoreboard. For each participant (including yourself), the time of the accepted submission for each of the problems is given. Also, for each solution you already know whether you are able to hack it or not. The only changes in the scoreboard that will happen before the end of the round are your challenges. What is the best place you may take at the end? More formally, $ n $ people are participating (including yourself). For any problem, if it was solved by exactly $ k $ people at the end of the round, the maximum score for this problem is defined as: 1. If $ n<2k

The first line of the input contains a single integer $ n $ ( $ 1

Print the only integer — the best place you can take at the end of the round.

Consider the first sample. If you do not hack any solutions, you will win the contest (scoreboard to the left). However, if you hack the solution of the first problem of the third participant (the only one you can hack), the maximum score for the first problem will change and you will finish second (scoreboard to the right).