Time limit：1s

Space restriction：1024KiB

---

Background

Outside the window on a cloudy evening
Someone is waiting in the future
Look left, right and forward
Love has to turn a few corners before it comes
What kind of dialogue will I have with whoever I meet?
How far is his future?
I heard the wind coming from the subway and the sea of people.
I'm in line with the number plate of love.
, ^_^

Description

In cities, people always hold numbers, keep looking for and matching, but no one knows who they are waiting for.
But Liang is different. Liang knows who he is waiting for, because Liang is good at mathematics. Liang discovered a magical algorithm: assuming that his number plate had the number S on it, the sum of all the positive divisors of the number plate number on his or her hand must be equal to S.
So Liang always looks for numbers on the subway and in the sea of people with a number plate. But he was busy singing "Green Light" and wanted to ask you to write a program that could quickly find all the people he was waiting for.

Format

Input

The input contains k sets of data. For each set of data, the input contains a number plate S.

Output

For each set of data, there are two lines of output. The first line contains an integer m, representing people with m equal.
The second line contains the corresponding M numbers, representing the number plates of all the people.
Note: The number plates you output must be arranged in descending order.

Sample

Input

42

Output

3
41 26 20

Limitation

1s, 1024KiB for each test case.
For 100% data, K is less than 100, S is less than 2 x 10 ^ 9.
Note: All input and output files are returned at the end of the text.

Source

@liang