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 x in range(1, n + 1):
        for s in squares:
            if s > x:
                break
            if dp[x - s] + 1 < dp[x]:
                dp[x] = dp[x - s] + 1

    return dp[n]