PROGRAMMING:Get rid of Bachelors
The so-called "Bachelor" here does not mean single, but refers to the number composed of 1, such as 1, 11, 111, 1111, etc. It is said that any bachelor can be divided by an odd number that does not end with 5. For example, 111111 can be divided by 13. Now, your program will read in an integer 'x', which must be odd and not end with 5. Then, after calculation, two numbers are output: the first number's', which means that 'x' multiplied by's' is a bachelor, and the second number 'n' is the number of the bachelor. This solution is not the only one. The problem requires you to output the smallest solution.
Tip: an obvious way is to gradually increase the number of singles until 'x' is divisible. But the difficulty is that's' may be a very large number - for example, if the program inputs 31, it outputs 3584229390681 and 15, because the result of multiplying 31 by 3584229390681 is 111111111111, a total of 15 ones.
###Input format:
Enter a positive odd number 'x' ($< 1000 $$) that does not end with 5 on a line.
###Output format:
Output the smallest corresponding's' and 'n' in a row, separated by a space.
###Input example:
```in
thirty-one
```
###Output example:
```out
3584229390681 15
```
answer：If there is no answer, please comment
Tip: an obvious way is to gradually increase the number of singles until 'x' is divisible. But the difficulty is that's' may be a very large number - for example, if the program inputs 31, it outputs 3584229390681 and 15, because the result of multiplying 31 by 3584229390681 is 111111111111, a total of 15 ones.
###Input format:
Enter a positive odd number 'x' ($< 1000 $$) that does not end with 5 on a line.
###Output format:
Output the smallest corresponding's' and 'n' in a row, separated by a space.
###Input example:
```in
thirty-one
```
###Output example:
```out
3584229390681 15
```
answer：If there is no answer, please comment