시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 128 MB 27 5 4 15.385%

문제

The cows are forever competing to see who has the best brand. The latest rage is brands that are 'Wonderprimes'. You probably already know that a brand consists of a sequence of digits that does not begin with 0; brands actually look a lot like positive integers.

A wonderprime is a number that can be partitioned into two prime numbers, each of which has at least D digits and, of course, doesn't start with 0. When D=2, the number 11329 is a wonderprime (since it connects 113 and 29, both of which are prime).

Only a few of the cows have wonderprime brands, but they all want one. Your job is to find the first wonderprime greater than or equal to a supplied integer N (1 <= N <= 2,000,000,000). No integer greater than 2,000,000,000 will be required.

입력

  • Line 1: Two space-separated integers: D and N

출력

  • Line 1: A line that contains the first wonderprime no smaller than N.

예제 입력

2 11328

예제 출력

11329

힌트