Maximize Treats

Jessica wants to prepare treat bags with exactly \(m\) units of money. There are three kinds of treats available:

• Lollipops: 2 units each
• Chocolates: 3 units each
• Cookies: 5 units each

To maximize the number of treats in each bag, she should always buy the cheapest treat available (i.e. lollipops). Given \(m\), compute the maximum number of treats she can purchase, which is mathematically equal to \(\lfloor \frac{m}{2} \rfloor\).

inputFormat

The input is provided as a single integer \(m\) (where \(0 \le m \le 10^9\)) on standard input.

outputFormat

Output a single integer representing the maximum number of treats that can be bought.

20

10