Given an integer n, you are asked to find as few perfect squares (1, 4, 9, 16, 25, 36, etc.) as possible that sum up to n. How many perfect squares would you pick?

Input

The input contains a single integer n (1 β€ n β€ 60000).

Output

The program should print the minimum number of perfect squares you would pick.