





from maths.prime_check import is_prime





def   lowerCAmelCase_				( __a	)  ->	int:







  """simple docstring"""





  if not isinstance(__a			,					__a	):
    lowerCamelCase__:   Dict    						=F"""Input value of [number={number}] must be an integer"""
    raise TypeError(__a	)
  if is_prime(__a	) and is_prime(number + 2	):
    return number + 2
  else:
    return -1


if __name__ == "__main__":
     import doctest

     doctest.testmod()








from bisect import bisect
from itertools import accumulate





def   lowerCAmelCase_				( __a			,					__a			,					__a			,					__a	)  ->	List[Any]:







  """simple docstring"""





  lowerCamelCase__:   str    						=sorted(zip(__a			,					__a	)			,					key=lambda __a	: x[0] / x[1]			,					reverse=__a	)
  lowerCamelCase__						,      lowerCamelCase__:   str    						=[i[0] for i in r], [i[1] for i in r]
  lowerCamelCase__:   Tuple    						=list(accumulate(__a	)	)
  lowerCamelCase__:   Any    						=bisect(__a			,					__a	)
  return (
      0
      if k == 0
      else sum(vl[:k]	) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
      if k != n
      else sum(vl[:k]	)
  )


if __name__ == "__main__":
     import doctest

     doctest.testmod()

