Description

Given a positive integer k where 2 ≤ k ≤ 9, and a non-negative decimal integer c with a maximum length of 30 digits, find all k values that can divide c without a remainder.

Input Format

A non-negative integer c, where the number of digits in c is ≤ 30.

Output Format

If there exist k values satisfying c % k == 0, output all such k values in ascending order, separated by single spaces. If no such k exists, output "none".

30

2 3 5 6