女子高生プログラマーの大バトル！〜コボール文明の逆襲〜

Excavation Game

Your team is building an excavation game where users won rewards when the users excavate OOPArts. You are building a module to calculate the rewards.

The procedure to calculate the amounts of rewards offered of is as follows.

First, you are given random double digits "N". The amounts of rewards offered of, "R", are calculated as: R = N + (tens place of "N") + (ones place of "N")

The amount for the random digits "27" is calculated as follows:

You are given a random double digits "N". Find the amounts of reward offered of, "R".

Find the amounts of reward offered of, "R".

Input

Input is given in the following format:

Constraints

All test cases have the following constraints:

10 ≦ N ≦ 99

Output

Output the amounts of the the rewards offered of, "R".
Add a newline character at the end of the output. Do not include any unnecessary characters or empty lines.

Input example 1: 27

Output example 1: 36

Input example 2: 97

Output example 2: 113

Answer

Please enter and submit the code that solves the problem above using the text box below.
You can use the following languages： Java, PHP, Ruby, Perl, Python, C, C#, and C++.

To find out about methods for reading values from standard input, please refer to the sample codes shown in the pages below：

Select language

Code execution result

Nickname (Required)	You can use letters and numbers. This nickname may be displayed on our site when we publish your codes as sample solutions, or when we announce the prize winners.
email (Required)	Your registered e-mail address will not be used outside of Paiza Online Hackathon. Once you submit your code, we will e-mail your results page.