PROGRAMMING:The strongest prime
Xiao Li easily defeated his classmates with your help, so the malicious classmates gave a question to embarrass Xiao Li. As a teammate like Xiao Li, you have to work hard again.
The prime 41 can be written as the sum of six consecutive primes: 41 = 2 + 3 + 5 + 7 + 11 + 13.
Now, among the prime numbers within n, the number that can be expressed as the sum of the most continuous prime numbers. If there are multiple answers, please output the largest prime number.
###Input format:
Only one line, an integer n.
###Output format:
The output is an integer, which is the prime number that can be expressed as the sum of the most continuous primes.
###Input example:
```in
one hundred
```
###Output example:
```out
forty-one
```
[example description]
41=2+3+5+7+11+13
[data scale]
30% data, 1 < = n < = 1000
60% of data, 1 < = n < = 10000
80% of data, 1 < = n < = 100000
100% of the data, 1 < = n < = 1000000 < br > < br > < br > < br > < br > 1
answer：If there is no answer, please comment
The prime 41 can be written as the sum of six consecutive primes: 41 = 2 + 3 + 5 + 7 + 11 + 13.
Now, among the prime numbers within n, the number that can be expressed as the sum of the most continuous prime numbers. If there are multiple answers, please output the largest prime number.
###Input format:
Only one line, an integer n.
###Output format:
The output is an integer, which is the prime number that can be expressed as the sum of the most continuous primes.
###Input example:
```in
one hundred
```
###Output example:
```out
forty-one
```
[example description]
41=2+3+5+7+11+13
[data scale]
30% data, 1 < = n < = 1000
60% of data, 1 < = n < = 10000
80% of data, 1 < = n < = 100000
100% of the data, 1 < = n < = 1000000 < br > < br > < br > < br > < br > 1
answer：If there is no answer, please comment