# Min Squares

easy

1. You are given a number N. 2. You have to find the minimum number of squares that sum to N. 3. You can always represent a number as a sum of squares of other numbers. For eg -> In worst case N can be represented as (1*1) + (1*1) + (1*1)..... N times.

## Constraints

1 <= N <= 10^5

## Format

### Input

An integer N

### Output

Check the sample output and question video.

## Example

Sample Input

35

### Sample Output

3

Question Video