#include<iostream>
#include<math.h>
#include<iomanip>
#include <string>
#include<algorithm>
#include <vector>
using namespace std;
void fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
//bool isPrime(int n) {
// if (n <= 1) return false;
// for (int i = 2; i * i <= n; i++)
// if (n % i == 0) return false;
// return true;
//}
int main() {
fast();
long long n, m, k;
cin >> n >> m >> k;
int res = 0;
int x = min(n, min(m, k));
res += x;
n -= x; m -= x; k -= x;
if (m != 0)
cout << res;
else {
if (k >= n/2 && n!=1) {
res += (n / 2);
cout << res;
}
else {
res += k;
cout << res;
}
}
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPG1hdGguaD4KI2luY2x1ZGU8aW9tYW5pcD4KI2luY2x1ZGUgPHN0cmluZz4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBmYXN0KCkKewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsKICAgIGNpbi50aWUoMCk7CiAgICBjb3V0LnRpZSgwKTsKfQoKLy9ib29sIGlzUHJpbWUoaW50IG4pIHsKLy8gICAgaWYgKG4gPD0gMSkgcmV0dXJuIGZhbHNlOwovLyAgICBmb3IgKGludCBpID0gMjsgaSAqIGkgPD0gbjsgaSsrKQovLyAgICAgICAgaWYgKG4gJSBpID09IDApIHJldHVybiBmYWxzZTsKLy8gICAgcmV0dXJuIHRydWU7Ci8vfQoKaW50IG1haW4oKSB7CgogICAgZmFzdCgpOwogICAgbG9uZyBsb25nIG4sIG0sIGs7CiAgICBjaW4gPj4gbiA+PiBtID4+IGs7CgogICAgaW50IHJlcyA9IDA7CiAgICBpbnQgeCA9IG1pbihuLCBtaW4obSwgaykpOwogICAgcmVzICs9IHg7CiAgICBuIC09IHg7IG0gLT0geDsgayAtPSB4OwoKICAgIGlmIChtICE9IDApCiAgICAgICAgY291dCA8PCByZXM7CgogICAgZWxzZSB7CiAgICAgICAgaWYgKGsgPj0gbi8yICYmIG4hPTEpIHsKICAgICAgICAgICAgcmVzICs9IChuIC8gMik7CiAgICAgICAgICAgIGNvdXQgPDwgcmVzOwogICAgICAgIH0KICAgICAgICBlbHNlIHsKICAgICAgICAgICAgcmVzICs9IGs7CiAgICAgICAgICAgIGNvdXQgPDwgcmVzOwogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gMDsKfQ==