Square into Squares. Protect tre

def decompose(n):
result =[n]
goal = 0
while(result):
current = result.pop()
goal += goal * goal
for i in range(current-1,0,-1):
if goal - ii >= 0:
result.append(i)
goal -= ii
if goal == 0:
result.sort()
return result
return None