CF903C Boxes Packing

Mishka has got $ n $ empty boxes. For every $ i $ ( $ 1

The first line contains one integer $ n $ ( $ 1

Print the minimum possible number of visible boxes.

In the first example it is possible to put box $ 1 $ into box $ 2 $ , and $ 2 $ into $ 3 $ . In the second example Mishka can put box $ 2 $ into box $ 3 $ , and box $ 4 $ into box $ 1 $ .