Reciprocal Omissions

아직 제출이 없습니다시간 제한1초메모리 제한1024 MB

문제 설명

예제1

문제

For each n in the integers 1..9 find the smallest m such that 1/m is a repeating decimal whose repeating part contains all the digits 0..9 except n. The repeating part might include some digits more than once.

입력

A single line containing N (1 ≤ N ≤ 9)

출력

A single line containing m and the first 25 digits of its decimal expansion after any leading zeros.