def get_Min_Squares(n):
    if n <= 0:
        return 0

    dp = [0] + [float("inf")] * n

    squares = []
    i = 1
    while i * i <= n:
        squares.append(i * i)
        i += 1

    for value in range(1, n + 1):
        for square in squares:
            if square > value:
                break
            dp[value] = min(dp[value], dp[value - square] + 1)

    return dp[n]