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.


hide comments
rdrsadhu: 2018-01-20 10:15:37

For Python use

for line in sys.stdin:

hari_krishna_6: 2018-01-11 12:39:42

no need of dp just use recursion . AC in one Go.!!

as3eem: 2018-01-06 04:27:03

I wouldn't have commented this if I hadn't suffered. Seriously @viniet_sw .... +1 for your comment.
motherfucker long long int

Last edit: 2018-01-06 04:39:46
akansh_17: 2018-01-05 15:45:07

Ac in 2nd go!!!

viniet_sw: 2017-12-26 22:03:12

long long int ki maa ka bhosada

hercules_7: 2017-12-10 18:12:33

Enjoyed solving this. do Memoization using hashmap till 10^5 and normal recursive approach for >10^5

divyansh0: 2017-12-06 15:41:15

Got correct answer on ideone but got segmentation fault while submitting in spoj

laskowski93: 2017-12-04 01:53:31

Managed to code this with 7 lines in c++(if you would like to make it ugly, you can write it in 3 ;) ). Ez

Last edit: 2017-12-04 02:05:14
armageddon117: 2017-11-14 18:08:20

I remember solving this one on CodeChef !

sahil070197: 2017-10-25 20:15:16

while(cin>>n)
solve(n)
This will help you in taking undefined number of test cases as input


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