# Complete the get_count function below. def get_count(n):

Squared summation of digits Find the count of the positive integers smaller than or equal to a given number n which satisfy the property that the repeated squared summation of its digits results in the number 1. For instance, the number 19 satisfies this property because: 112+9A2-82 2) 8A2 2A2 68 3)642+822-100 4)142+0 2+042-1 Note that a number satisfies this property regardless of the number of steps it takes, so long as the number 1 is achieved through repeated squared summation of digits. You will be given the number n, your code must produce the integer m which is the count of numbers that satisfies this property