Perfect Squares :
Difficulty Level : Easy
Submissions : 1447
Asked In :
Marks :10
: 14 | : 4
Given an integer $$$n$$$, return the least number of perfect square numbers that sum to $$$n$$$.
Input
The input consists of a single integer $$$n$$$ $$$-$$$ $$$(1 \leq n \leq 10^9)$$$.
Output
The output should consist of a single integer $$$-$$$ the minimum number of perfect square numbers that sum to $$$n$$$.
Example
Input
5
Output
2
