SP51 TOUR - Fake tournament

We consider only special type of tournaments. Each tournament consists of a series of matches. We have _n_ competitors at the beginning of a competition and after each match the loser is moved out of the competition and the winner stays in (there are no draws). The tournament ends when there is only one participant left - the winner. It is a task of National Sports Federation to schedule the matches. Members of this committee can pick the contestants for the first match. Then, after they know the result, they say which of the remaining contestants meet in the second match, and so on until there is only one participant left. It is easy to see that not only skill and training decides about the win, but also "luck" - i.e. the schedule. The members of NSF know it as well. The committee used the training time to look carefully on the performance of each probable contestant. It is clear now, at the start of the season, that some of the results between the competitors are 100% predictable. Having this information NSF considers if it is possible to schedule the matches in such a way that the given contestant **x** wins. That is to plan the matches for **x** only with those who will lose with him (then he wins the whole tournament of course). If it is possible then w say that **the tournament can be set for x**. Task ---- Your task is to write a program which determines the number of contestants of a given tournament for which it is possible to set it.

N/A

N/A