Description

In the previous problem, Little Tu added up the digits of an OJ version number 483 (4+8+3)=15. Then, he decomposed 483 into its prime factors: 483=3×7×23, and added up the digits of these prime factors (3+7+2+3), which also summed to 15. We refer to such cases as "correct OJ versions," where a version number (a composite number) has the sum of its digits equal to the sum of the digits of all its prime factors combined. Can you help Little Tu find all such correct OJ versions within n (inclusive)?

Input Format

An integer n (10≤n≤30000).

Output Format

Several lines, each outputting 5 numbers that satisfy the problem's conditions.

```input1 100 ``` ```output1 4 22 27 58 85 94 ``` ## Translation

CodesOJ original and adapted problems