def tripleStep(n):

memo = [0]*(n+1)
memo[0] = 1
memo[1] = 1
memo[2] = 2
memo[3] = 4
for i in range(4, n+1):
memo[i] = memo[i-1] + memo[i-2] + memo[i-3]
return memo[n]

def counSteps(self, n):

memo = [None for _ in range(n+1)]
return self.count(n, memo)

def count(self, n, memo):

if n < 0:
return 0
elif n == 0:
return 1
else:
memo[n] = self.count(n-1, memo) + self.count(n-2, memo) + self.count(n-3,
memo)
return memo[n]

print(tripleStep(7))