Basecamp
Home
Problems
Contests
Ranking
Posts
Sign in
Statement
Editor
Input
Execution
Testing
Discussion
Attempts
Recursive function 1
Very easy
English
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
Find the value of the function:
f
(
n
)
=
{
1
,
n
=
0
f
(
n
/2
)
+
f
(
n
/3
)
,
n
>
0
Input
One positive integer
n
(
1
≤
n
≤
1
0
18
)
.
Output
Print the value of
f
(
n
)
.
Examples
Input #1
Answer #1