C. Table Tennis Game 2

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.

思路：

先说题意，A,B两人打乒乓球赛，回合制，一回合中，赢一球得一分，对方不得分。其中之一得到的分数等于

k值，当前回合结束，分数清零。现在给你两个人比赛里的总分a和b，求最多打几回合。

理解：

使回合最多，那肯定是k：0或者是0：k的评分时，也就是最多有a/k+b/k回合。

注意，不可能情况就输出-1，什么事不可能情况。

若，a%k！=0，那么在B会胜利的一局中将那个余数消耗掉。所以当a%k&&b/k==0时，输出-1；

同理，b%k&&a/k==0也是。

代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<stack>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int main()
{
    int n,a,b;
    cin>>n>>a>>b;
    int m=a/n+b/n;
    if(a/n==0&&b%n||b/n==0&&a%n)
        cout<<"-1"<<endl;
    else
        cout<<m<<endl;
}