#include <bits/stdc++.h>
using namespace std;
long long int cons;
long long int check(long long int a) {
  if (a >= cons) a %= cons;
  return a;
}
long long int check2(long long int a) {
  a %= cons;
  if (a < 0) a += cons;
  return a;
}
long long int GCD(long long int a, long long int b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long int exp(long long int a, long long int n) {
  if (n == 0) return 1;
  if (n == 1) return check(a);
  long long int b = exp(a, n / 2);
  if (n % 2 == 0) return check(b * b);
  return check(b * check(b * a));
}
const int N = 200010;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cons = 1e9 + 7;
  int n, a, b;
  cin >> n >> a >> b;
  int ans = 0;
  while (true) {
    ans++;
    int c1 = a / ans;
    int c2 = b / ans;
    if (c1 > 0 && c2 > 0 && (c1 + c2 >= n))
      continue;
    else
      break;
  }
  cout << ans - 1;
}
