class Solution:
def tribonacci(self, n: int) -> int:
return [0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,66012,
121415,223317,410744,755476,1389537,2555757,4700770,8646064,15902591,29249425,53798080,
98950096,181997601,334745777,615693474,1132436852,2082876103][n]


뇌를 쓰지 않아서 좋았다

LFU Cache는 하려면 할 거 같은데.... 굳이?