Codeforces Round #397 by Kaspersky Lab and Barcelona Bootcamp (Div. 1 + Div. 2 combined) C

Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he receives one point and the loser receives nothing. Once one of the players scores exactly k points, the score is reset and a new set begins.

Across all the sets Misha scored a points in total, and Vanya scored b points. Given this information, determine the maximum number of sets they could have played, or that the situation is impossible.

Note that the game consisted of several complete sets.

Input

The first line contains three space-separated integers k, a and b (1 ≤ k ≤ 109, 0 ≤ a, b ≤ 109, a + b > 0).

Output

If the situation is impossible, print a single number -1. Otherwise, print the maximum possible number of sets.

Examples

input

11 11 5

output

1

input

11 2 3

output

-1

Note

Note that the rules of the game in this problem differ from the real table tennis game, for example, the rule of "balance" (the winning player has to be at least two points ahead to win a set) has no power within the present problem.

题意：给出k,a,b，如果由一方先出现k点，则清零重新开始比赛，问根据a，b可以知道最多可以比几场

解法：首先可以猜出，a，b都小于k不符合要求，以及比赛成绩一定是ans=a/k+b/k，但是如果出现k点就清零，所以没有大于k是比分出现，也就是说a或者b大于k，而另一个小于k也是不符合要求的

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int k,a,b;
    cin>>k>>a>>b;
    if(a>b)
    {
        swap(a,b);
    }
    if(a<k&&b<k)
    {
        cout<<"-1";
        return 0;
    }
    else if(a/k==0&&b%k)
    {
        cout<<"-1";
        return 0;
    }
    int ans=(a/k+b/k);
    cout<<ans<<endl;
    return 0;
}