~D~ digits is a ~D~-level prime pair certificate. Leading zeroes are not permitted.likes numbers which are constructed by concatenating two prime numbers together. A number which can be formed by concatenating two primes that both have at least
Given two integers ~D~ and ~N~, compute the smallest ~D~-level prime pair certificate greater than or equal to ~N~.
The output will never exceed ~2 \cdot 10^9~.
There are no subtasks for this problem.
The input will consist of two positive space separated integers, ~D~ and ~N~.
Output the smallest ~D~-level prime pair certificate greater than or equal to ~N~.