Maximum Square Formations

Given a positive integer (N), determine the maximum number of perfect square formations that can be created using exactly (N) pebbles. Each formation requires (k^2) pebbles for some integer (k). Mathematically, you are required to compute the greatest integer (k) such that (k^2 \leq N), i.e., (k = \lfloor \sqrt{N} \rfloor).

inputFormat

The input consists of a single line containing one integer (N) representing the total number of pebbles.

outputFormat

Output a single integer representing the maximum number of square formations that can be created from (N) pebbles, which is (\lfloor \sqrt{N} \rfloor).## sample

16

4