QOJ.ac

QOJ

Time Limit: 2 s Memory Limit: 256 MB Total points: 100

#22762. Digital Persistences

Statistics

The cows play a game with numbers. They start with some number, say, 6593. They extract the digits (e.g., 6, 5, 9, 3) and multiply them together to form a product (in this case, $6 x 5 x 9 x 3 = 810$). They do this again (e.g., $8 x 1 x 0$) to get 0, a one digit number.

Help the cows play their game. Read in a number and show the steps to get to a single digit.

Input

A starting integer $N$ ($10 \le N \le 2{,}000{,}000{,}000$).

Output

A single line with integers that are the starting number and the successive numbers from the calculation until a single digit is obtained.

Examples

Input 1

98886

Output 1

98886 27648 2688 768 336 54 20 0

Problem credits: Russ Cox

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.