Owl`s Problem
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Everyone knows that the most intelligent one in the woods is Owl. To be the most intelligent one it is necessary to read much, that’s why Owl spend most of its free time with books in the library.
Reading one of the most favorite books - "Encyclopedia of problems in mathematics", Owl met this formula:
Inquisitive Owl is very interested with a question, at which the maximum integer A and a integer B, such as S(A) and S(B) are also integer, is going executing the inequality S(A) ≤ S(N) ≤ S(B).
Input
The first line contains one single number N (0 < N ≤ 2^60).
Output
To put out two required numbers A and B with space, which are corresponded to the inequality.
Examples
Input #1
Answer #1
Submissions 643
Acceptance rate 31%