#include <bits/stdc++.h>
using namespace std;
int N, A, B;
bool check(int n) { return (A >= n && B >= n && N <= (A / n + B / n)); }
int bsearch(int l, int r) {
  if (l > r) {
    return 0;
  }
  int mid = (l + r) / 2, ret;
  if (check(mid)) {
    ret = bsearch(mid + 1, r);
    return (mid > ret ? mid : ret);
  } else {
    return bsearch(l, mid - 1);
  }
  return 0;
}
int main() {
  cin >> N >> A >> B;
  cout << bsearch(1, 100) << endl;
  return 0;
}
