PROGRAMMING:CPA strongest continuous prime (I really sign in question o (∩)_ ∩)O !)
Given a number, we need to output three consecutive prime numbers less than or equal to this number with a difference of 2, such as 357. If there are multiple groups, we need to output three in each line. If there is no, we need to output "little guy juice, no Wude mouse tail juice"（ A prime number is a factor that has only one and its own number. A factor of 4 has 1, 2, 4. Besides 1 and it has other factors, so it is not a prime number.
###Input format:
A positive integer n is given in one line, (0 < = n < 2 ^ 31-1 is guaranteed to be in the range of shaping).
###Output format:
Consistent with the requirements of the title.
###Input sample 1:
```in
seven
```
###Output example:
```out
3 5 7
```
###Input sample 2:
```in
three
```
###Output example:
```out
Don't talk about Wude mouse tail juice
```
answer：If there is no answer, please comment
###Input format:
A positive integer n is given in one line, (0 < = n < 2 ^ 31-1 is guaranteed to be in the range of shaping).
###Output format:
Consistent with the requirements of the title.
###Input sample 1:
```in
seven
```
###Output example:
```out
3 5 7
```
###Input sample 2:
```in
three
```
###Output example:
```out
Don't talk about Wude mouse tail juice
```
answer：If there is no answer, please comment