from math import ceil





def    __lowercase     (						lowerCamelCase					:     int = 1001	):
 UpperCamelCase_					:						Optional[Any] =					1

 for i in range(1  ,  int(ceil(n / 2.0	)	)	):
  UpperCamelCase_					:						int =					2 * i + 1
  UpperCamelCase_					:						Tuple =					2 * i
  UpperCamelCase_					:						Optional[Any] =					total + 4 * odd**2 - 6 * even

 return total


if __name__ == "__main__":
   import sys

   if len(sys.argv) == 1:
      print(solution())
   else:
      try:
         a_    					=       int(sys.argv[1])
         print(solution(n))
      except ValueError:
         print('Invalid entry - please enter a number')




from maths.prime_check import is_prime





def    __lowercase     (						lowerCamelCase					:     int	):
 if not isinstance(lowerCamelCase  ,  lowerCamelCase	):
  UpperCamelCase_					:						List[str] =					F"Input value of [number={number}] must be an integer"
  raise TypeError(lowerCamelCase	)
 if is_prime(lowerCamelCase	) and is_prime(number + 2	):
  return number + 2
 else:
  return -1


if __name__ == "__main__":
   import doctest

   doctest.testmod()



