"""
[03/04/13] Challenge #121 [Easy] Bytelandian Exchange 1

https://www.reddit.com/r/dailyprogrammer/comments/19mn2d/030413_challenge_121_easy_bytelandian_exchange_1/

# [](#EasyIcon) *(Easy)*: Bytelandian Exchange 1
Bytelandian Currency is made of coins with integers on them. There is a coin for each non-negative integer (including
0). You have access to a peculiar money changing machine. If you insert a N-valued coin, with N positive, It pays back
3 coins of the value N/2,N/3 and N/4, rounded down. For example, if you insert a 19-valued coin, you get three coins
worth 9, 6, and 4. If you insert a 2-valued coin, you get three coins worth 1, 0, and 0. _0-valued coins cannot be used
in this machine._
One day you're bored so you insert a 7-valued coin. You get three coins back, and you then insert each of these back
into the machine. You continue to do this with every positive-valued coin you get back, until finally you're left with
nothing but 0-valued coins. You count them up and see you have 15 coins.
How many 0-valued coins could you get starting with a single 1000-valued coin?
*Author: Thomas1122*
# Formal Inputs & Outputs
## Input Description
The value N of the coin you start with
## Output Description
The number of 0-valued coins you wind up with after putting every positive-valued coin you have through the machine.
# Sample Inputs & Outputs
## Sample Input
7
## Sample Output
15
# Challenge Input
1000
## Challenge Input Solution
???
# Note
Hint: use recursion!
Please direct questions about this challenge to /u/Cosmologicon
				
"""


def main():
    pass


if __name__ == "__main__":
    main()

cfe408706877a1d5c7a88732ccc8b56523125db0
<mask token>

<mask token>


def main():
    pass


<mask token>

<mask token>


def main():
    pass


if __name__ == '__main__':
    main()

"""
[03/04/13] Challenge #121 [Easy] Bytelandian Exchange 1

https://www.reddit.com/r/dailyprogrammer/comments/19mn2d/030413_challenge_121_easy_bytelandian_exchange_1/

# [](#EasyIcon) *(Easy)*: Bytelandian Exchange 1
Bytelandian Currency is made of coins with integers on them. There is a coin for each non-negative integer (including
0). You have access to a peculiar money changing machine. If you insert a N-valued coin, with N positive, It pays back
3 coins of the value N/2,N/3 and N/4, rounded down. For example, if you insert a 19-valued coin, you get three coins
worth 9, 6, and 4. If you insert a 2-valued coin, you get three coins worth 1, 0, and 0. _0-valued coins cannot be used
in this machine._
One day you're bored so you insert a 7-valued coin. You get three coins back, and you then insert each of these back
into the machine. You continue to do this with every positive-valued coin you get back, until finally you're left with
nothing but 0-valued coins. You count them up and see you have 15 coins.
How many 0-valued coins could you get starting with a single 1000-valued coin?
*Author: Thomas1122*
# Formal Inputs & Outputs
## Input Description
The value N of the coin you start with
## Output Description
The number of 0-valued coins you wind up with after putting every positive-valued coin you have through the machine.
# Sample Inputs & Outputs
## Sample Input
7
## Sample Output
15
# Challenge Input
1000
## Challenge Input Solution
???
# Note
Hint: use recursion!
Please direct questions about this challenge to /u/Cosmologicon
				
"""


def main():
    pass


if __name__ == "__main__":
    main()
