Migrated from Lutece 1554 C0ins

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

There are infinite coins with values $1, 2, 5, 10$.

What's the minimum numbers of coins should be picked that $X$ and $Y$ can be made change for?

Input

Two integers $X$ and $Y$. ($1\leq X, Y\leq 10^9$)

Output

The minimum numbers of coins should be picked.

Samples

8 9

4

Note

In sample, four coins $1, 2, 2, 5$ and $1, 1, 2, 5$ both can make change for $8$ and $9$.

Resources

The 15th UESTC Programming Contest Preliminary