# Gardener

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

The Gardener planted $N$ trees during the day. And he had to pour out one pail of water under each seedling. It was raining that day, so the Gardener began to water the trees not from the day of planting, but from some $K$-th day.

How many days the Gardener didn’t water the trees, if he poured $N1 $ part of water of a pail under every tree in last day, the day before it - $N−11 $ part, etc. and in whole he poured under every tree no more than a half of pail of water?

## Input

The number of the trees $N(0<N≤1000000)$.

## Output

The number of days the Gardener didn’t water the trees since day of planting.

## Examples

Input #3

Answer #3

Submissions 18K

Acceptance rate 30%