



'''simple docstring'''






def        snake_case_   (	lowerCAmelCase_			,  lowerCAmelCase_						)->						int:





       '''simple docstring'''


       _UpperCAmelCase    :		Optional[int]     	=					1.0
       for i in range(1			,  r + 1						):
              ret *= (n + 1 - i) / i
       return round(lowerCAmelCase_						)




def        snake_case_   (	lowerCAmelCase_						)->						int:





       '''simple docstring'''


       return choose(8 + n			,  lowerCAmelCase_						) + choose(9 + n			,  lowerCAmelCase_						) - 10




def        snake_case_   (	lowerCAmelCase_						)->						int:





       '''simple docstring'''


       return sum(non_bouncy_exact(lowerCAmelCase_						) for i in range(1			,  n + 1						)						)




def        snake_case_   (	lowerCAmelCase_ = 100						)->						int:





       '''simple docstring'''


       return non_bouncy_upto(lowerCAmelCase_						)


if __name__ == "__main__":
   print(f"""{solution() = }""")






from __future__ import annotations





def 				__a							(       __A						):
    SCREAMING_SNAKE_CASE__         =    {1}
    SCREAMING_SNAKE_CASE__         =    [1]
    for _ in range(2			,							depth + 1						):
        SCREAMING_SNAKE_CASE__         =    [*previous_coefficients, 0]
        SCREAMING_SNAKE_CASE__         =    [0, *previous_coefficients]
        SCREAMING_SNAKE_CASE__         =    []
        for x, y in zip(__A			,							__A						):
            coefficients.add(x + y						)
            previous_coefficients.append(x + y						)
    return coefficients





def 				__a							(       __A						):
    SCREAMING_SNAKE_CASE__         =    set()
    for number in unique_coefficients:
        SCREAMING_SNAKE_CASE__         =    2
        SCREAMING_SNAKE_CASE__         =    number
        while divisor**2 <= copy_number:
            SCREAMING_SNAKE_CASE__         =    0
            while copy_number % divisor == 0:
                copy_number //= divisor
                multiplicity += 1
            if multiplicity >= 2:
                non_squarefrees.add(__A						)
                break
            divisor += 1

    return unique_coefficients.difference(__A						)





def 				__a							(       __A = 51						):
    SCREAMING_SNAKE_CASE__         =    get_pascal_triangle_unique_coefficients(__A						)
    SCREAMING_SNAKE_CASE__         =    get_squarefrees(__A						)
    return sum(__A						)


if __name__ == "__main__":
  print(f'''{solution() = }''')


