def   __A		(			_A = 10**12					):



 """simple docstring"""


 __a       =  1
 __a       =  0

 __a       =  1
 __a       =  1

 while numerator <= 2 * min_total - 1:
  prev_numerator += 2 * numerator
  numerator += 2 * prev_numerator

  prev_denominator += 2 * denominator
  denominator += 2 * prev_denominator

 return (denominator + 1) // 2


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



from __future__ import annotations



def   __A		(			_A					):



 """simple docstring"""


 __a       =  [True] * limit
 __a       =  False
 __a       =  False
 __a       =  True

 for i in range(3							,				int(limit**0.5 + 1					)							,				2					):
  __a       =  i * 2
  while index < limit:
   __a       =  False
   __a       =  index + i

 __a       =  [2]

 for i in range(3							,				_A							,				2					):
  if is_prime[i]:
   primes.append(_A					)

 return primes



def   __A		(			_A = 100_0000					):



 """simple docstring"""


 __a       =  prime_sieve(_A					)
 __a       =  0
 __a       =  0

 for i in range(len(_A					)					):
  for j in range(i + length							,				len(_A					)					):
   __a       =  sum(primes[i:j]					)
   if sol >= ceiling:
    break

   if sol in primes:
    __a       =  j - i
    __a       =  sol

 return largest


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


