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
Martijn Muijsers: 2014-01-11 19:36:00

Easy one, but nice problem. I made a stupid mistake in assuming output restrictions. For C++: I used 'while (scanf(...) == 1) { ... }'

Also: 2^8th problem solved! :)

Last edit: 2014-01-11 19:37:06
amit_gh: 2014-01-10 19:08:18

How to know that the input should be stopped and output displayed?

octopus: 2014-01-09 20:15:35

getting tle used memo and recursion please help submis id 10835105

Ashish Khatkar: 2013-12-22 20:29:56

I am getting SIGSEGV but my code is running fine on my machine & ideone. Any help!!!!
Link to my solution on ideone.
<snip>

Last edit: 2022-08-09 22:49:26
Praneeth : 2013-12-22 06:21:20

Recursive and DP..got accepted in 1 st go:)

DEVANSH PARASHAR: 2013-12-05 23:10:18

segmentation fault
AC FINALL NEEC TO USE MAP OR STL SIGSEV IN USEING ARRAY

Last edit: 2013-12-25 18:56:57
Saimadhav Heblikar: 2013-11-23 13:52:01

first dp ever.AC in 8.97 sec!!
enjoyed solving

Last edit: 2013-11-23 13:52:43
Cobuz Andrei: 2013-09-23 15:58:08

@Pritesh
while(cin>>n){
...Your coude here...
}

/* EDWARD KENWAY */: 2013-09-21 09:37:50

/* my 1st DP!!! */

Ouditchya Sinha: 2013-09-20 04:00:51

@Ajay singh gurjar : Post your code in the SPOJ Forum, then someone will surely respond.


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