Problem D. Numbairs

Input: standard input
Output: standard output
Memory limit: 256 Mb
Time limit: 0.1 sec

Consider number of the form where a is a positive integer that can appear in the notation twice or more. Let us call such numbers numbairs (which stands for number + stairs). For instance, both 27 = 3³ and 16 = are numbairs. Number 1 is, too, a numbair since 1 = 1¹. Find out how many numbairs there are between 1 and a number n given to you (inclusive).

Input

The input contains single integer n, 1 ≤ n ≤ 10⁹.

Output

Output number of numbairs not exceeding n.

Не нашли, что искали? Воспользуйтесь поиском: