COINS - Bytelandian gold coins

In Byteland they have a very strange monetary system.

Each Bytelandian gold coin has an integer number written on it. A coin n can be exchanged in a bank into three coins: n/2, n/3 and n/4. But these numbers are all rounded down (the banks have to make a profit).

You can also sell Bytelandian coins for American dollars. The exchange rate is 1:1. But you can not buy Bytelandian coins.

You have one gold coin. What is the maximum amount of American dollars you can get for it?

Input

The input will contain several test cases (not more than 10). Each testcase is a single line with a number n, 0 <= n <= 1 000 000 000. It is the number written on your coin.

Output

For each test case output a single line, containing the maximum amount of American dollars you can make.

Example

Input:
12
2

Output:
13
2

You can change 12 into 6, 4 and 3, and then change these into $6+$4+$3 = $13. If you try changing the coin 2 into 3 smaller coins, you will get 1, 0 and 0, and later you can get no more than $1 out of them. It is better just to change the 2 coin directly into $2.


Added by:Tomek Czajka
Date:2005-05-03
Time limit:9s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:Purdue Programming Contest Training

hide comments
2020-05-12 02:14:26
Can it be done without dynamic programming?
2020-05-08 11:29:56
For continuous inputs in c++ try
while(cin>>n)
{
..code
}
And for this problem just use memoization with a map as we cant take an array of size 10^9.
2020-05-04 10:06:04
I got no error while testing it in my ide. I got correct value for 1000000000. But i am getting wrong answer while submitting. I even used dp.Somebody please help me.
2020-04-27 14:18:47
@alche_mist02 u can look up for std:: iota
2020-04-17 14:07:08
use long long int
2020-04-11 17:05:08
@am_venkat_2000 Thank you very much
2020-04-11 15:38:54
@sameer_19 why should we do that way? for any kind of input can't we apply memoization using map
2020-04-01 13:22:19
@aryan_0406 I'm getting 4243218150 for n=1000000000
2020-03-04 19:48:22
Recursion with memoization using a map instead of array.
2020-01-28 17:15:16
while(cin>>n) @sachsri
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.