Problem 2B
Partial Primes

Description

An integer substring of an integer is formed by consecutive digits of the original integer. For example, the number 6158 contains the substrings 6, 1, 5, 8, 61, 15, 58, 615, 158, and 6158. You must find the largest substring of an integer that is also a prime.

Input

The input will be an integer N, (0 <= N <= 1,000,000,000).

Output

The output will be the largest prime substring of N. If no substring is a prime, then your program should print "No Primes"

Example 1

Input

2319

Output

31

Example 2

Input

6804

Output

No Primes