Equal Purchase Problem

Little Yang has \(n\) yuan for shopping. Product A costs \(a\) yuan and product B costs \(b\) yuan. He wishes to purchase an equal number of products A and B.

Each pair consisting of one product A and one product B costs \(a+b\) yuan. Your task is to compute the maximum number of pairs he can buy with his \(n\) yuan.

inputFormat

The input consists of a single line containing three space-separated integers: n, a, and b.

outputFormat

Output a single integer representing the maximum number of pairs of products A and B that can be purchased.

sample

10 2 3

2