






def   UpperCamelCase  (       snake_case__     :   Any = 200_0000  ):




     '''simple docstring'''






     __snake_case			:Tuple        =						[0 for i in range(n + 1  )]
     __snake_case			:Tuple        =						1
     __snake_case			:List[str]        =						1

     for i in range(2	,int(n**0.5  ) + 1  ):
          if primality_list[i] == 0:
               for j in range(i * i	,n + 1	,_lowerCamelCase  ):
                    __snake_case			:List[str]        =						1
     __snake_case			:Any        =						0
     for i in range(_lowerCamelCase  ):
          if primality_list[i] == 0:
               sum_of_primes += i
     return sum_of_primes


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










import os






def   UpperCamelCase  (       ):




     '''simple docstring'''






     __snake_case			:List[str]          =						os.path.dirname(os.path.realpath(snake_case__  )  )
     __snake_case			:Union[str, Any]          =						os.path.join(snake_case__	,"""triangle.txt"""  )

     with open(snake_case__  ) as f:
          __snake_case			:int          =						f.readlines()

     __snake_case			:int          =						[]
     for line in triangle:
          __snake_case			:List[Any]          =						[]
          for number in line.strip().split(""" """  ):
               numbers_from_line.append(int(snake_case__  )  )
          a.append(snake_case__  )

     for i in range(1	,len(snake_case__  )  ):
          for j in range(len(a[i]  )  ):
               __snake_case			:Union[str, Any]          =						a[i - 1][j] if j != len(a[i - 1]  ) else 0
               __snake_case			:Dict          =						a[i - 1][j - 1] if j > 0 else 0
               a[i][j] += max(snake_case__	,snake_case__  )
     return max(a[-1]  )


if __name__ == "__main__":
     print(solution())


