CF886C Petya and Catacombs

A very brave explorer Petya once decided to explore Paris catacombs. Since Petya is not really experienced, his exploration is just walking through the catacombs. Catacombs consist of several rooms and bidirectional passages between some pairs of them. Some passages can connect a room to itself and since the passages are built on different depths they do not intersect each other. Every minute Petya arbitrary chooses a passage from the room he is currently in and then reaches the room on the other end of the passage in exactly one minute. When he enters a room at minute $ i $ , he makes a note in his logbook with number $ t_{i} $ : - If Petya has visited this room before, he writes down the minute he was in this room last time; - Otherwise, Petya writes down an arbitrary non-negative integer strictly less than current minute $ i $ . Initially, Petya was in one of the rooms at minute $ 0 $ , he didn't write down number $ t_{0} $ . At some point during his wandering Petya got tired, threw out his logbook and went home. Vasya found his logbook and now he is curious: what is the minimum possible number of rooms in Paris catacombs according to Petya's logbook?

The first line contains a single integer $ n $ ( $ 1

In the only line print a single integer — the minimum possible number of rooms in Paris catacombs.

In the first sample, sequence of rooms Petya visited could be, for example $ 1→1→2 $ , $ 1→2→1 $ or $ 1→2→3 $ . The minimum possible number of rooms is $ 2 $ . In the second sample, the sequence could be $ 1→2→3→1→2→1 $ .