def 				UpperCamelCase					(     lowerCAmelCase_ )		->    str:




       '''simple docstring'''






       _A=						1
       _A=						0
       _A=						1
       _A=						1
       _A=						3
       _A=						3
       _A=						limit
       _A=						0

       _A=						''
       while counter != decimal + 1:
              if 4 * q + r - t < n * t:
                     result += str(lowerCAmelCase_ )
                     if counter == 0:
                            result += "."

                     if decimal == counter:
                            break

                     counter += 1
                     _A=						10 * (r - n * t)
                     _A=						((10 * (3 * q + r)) // t) - 10 * n
                     q *= 10
                     _A=						nr
              else:
                     _A=						(2 * q + r) * l
                     _A=						(q * (7 * k) + 2 + (r * l)) // (t * l)
                     q *= k
                     t *= l
                     l += 2
                     k += 1
                     _A=						nn
                     _A=						nr
       return result

def 				UpperCamelCase					(     )		->    None:




       '''simple docstring'''






       print(F"{calculate_pi(50 ) = }" )
       import doctest

       doctest.testmod()


if __name__ == "__main__":
      main()
from __future__ import annotations

def 				UpperCamelCase					(     lowerCAmelCase_ )		->    set[int]:




       '''simple docstring'''






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

def 				UpperCamelCase					(     lowerCAmelCase_ )		->    set[int]:




       '''simple docstring'''






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

       return unique_coefficients.difference(lowerCAmelCase_ )

def 				UpperCamelCase					(     lowerCAmelCase_ = 51 )		->    int:




       '''simple docstring'''






       _A=						get_pascal_triangle_unique_coefficients(lowerCAmelCase_ )
       _A=						get_squarefrees(lowerCAmelCase_ )
       return sum(lowerCAmelCase_ )


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