CF387C George and Number

George is a cat, so he really likes to play. Most of all he likes to play with his array of positive integers $ b $ . During the game, George modifies the array by using special changes. Let's mark George's current array as $ b_{1},b_{2},...,b_{|b|} $ (record $ |b| $ denotes the current length of the array). Then one change is a sequence of actions: - Choose two distinct indexes $ i $ and $ j $ $ (1

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

Print an integer — the maximum number of elements array $ b $ could contain originally.

Let's consider the test examples: - Originally array $ b $ can be equal to $ {5,9,5,5} $ . The sequence of George's changes could have been: $ {5,9,5,5}→{5,5,95}→{95,55}→{9555} $ . - Originally array $ b $ could be equal to $ {1000000000,5} $ . Please note that the array $ b $ cannot contain zeros. - Originally array $ b $ could be equal to $ {800,10,1} $ . - Originally array $ b $ could be equal to $ {45} $ . It cannot be equal to $ {4,5} $ , because George can get only array $ {54} $ from this array in one operation. Note that the numbers can be very large.