This is an interactive problem.
Your task is to write a program that guesses a secret number through repetitive queries and responses. The secret number is a non-negative integer less than 1018.
Let x be the secret number. In a query, you specify a non-negative integer a. In response to this, the digit sum of (x+a) will be returned. Here, the digit sum of a number means the sum of all the digits in its decimal notation. For example, the digit sum of 4096 is 4+0+9+6=19.
In this example, the secret number x is 75. In response to the first query, 15 is returned because x+a=75+3=78 and its digit sum is 7+8=15. After the second response, you can conclude that the only possible secret number is 75.