Factors of a Large Integer

Problem Background

Special for beginners, ^_^

Problem Description

Given a positive integer $k$ satisfying $2 \le k \le 9$, and a non-negative decimal integer $c$ whose length is at most $30$ digits, find all values of $k$ that divide $c$.

Input Format

One line containing a non-negative integer $c$, where the number of digits of $c$ is at most $30$.

Output Format

If there exists a $k$ such that c % k == 0, output all such $k$ in increasing order, separated by a single space. If no such $k$ exists, output none.

Sample Input

30

Sample Output

2 3 5 6

Constraints

Time limit: 1s, memory limit: 1024KiB for each test case.