#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+CiNpbmNsdWRlPG1hdGguaD4KI2luY2x1ZGU8aW9tYW5pcD4KI2luY2x1ZGUgPHN0cmluZz4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKCgp2b2lkIGZhc3QoKQp7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZSgwKTsKICAgIGNvdXQudGllKDApOwp9CgovL2Jvb2wgaXNQcmltZShpbnQgbikgewovLyAgICBpZiAobiA8PSAxKSByZXR1cm4gZmFsc2U7Ci8vICAgIGZvciAoaW50IGkgPSAyOyBpICogaSA8PSBuOyBpKyspCi8vICAgICAgICBpZiAobiAlIGkgPT0gMCkgcmV0dXJuIGZhbHNlOwovLyAgICByZXR1cm4gdHJ1ZTsKLy99CgppbnQgbWFpbigpIHsKCiAgICBmYXN0KCk7CiAgICBsb25nIGxvbmcgbiwgbSwgazsKICAgIGNpbiA+PiBuID4+IG0gPj4gazsKCiAgICBpbnQgcmVzID0gMDsKICAgIGludCB4ID0gbWluKG4sIG1pbihtLCBrKSk7CiAgICByZXMgKz0geDsKICAgIG4gLT0geDsgbSAtPSB4OyBrIC09IHg7CgogICAgaWYgKG0gIT0gMCkKICAgICAgICBjb3V0IDw8IHJlczsKCiAgICBlbHNlIHsKICAgICAgICBpZiAoayA+PSBuLzIgJiYgbiE9MSkgewogICAgICAgICAgICByZXMgKz0gKG4gLyAyKTsKICAgICAgICAgICAgY291dCA8PCByZXM7CiAgICAgICAgfQogICAgICAgIGVsc2UgewogICAgICAgICAgICByZXMgKz0gazsKICAgICAgICAgICAgY291dCA8PCByZXM7CiAgICAgICAgfQogICAgfQoKICAgIHJldHVybiAwOwp9