int countPerfectTeam(long long a, long long b, long long c)
{
    long long ans = 0, tmp;
    if (a < b) swap(a, b);
    tmp = min(a, min(b, c));
    ans += tmp;
    a -= tmp; b -= tmp; c -= tmp;
    long long Max = 0;
    for (int i = 0; i <= a/2; i++) {
        long long tmp = 0, aa = a - 2*i, bb = b - i;
        if (aa < 0 || bb < 0) continue;
        tmp = min(aa, bb/2);
        Max = max(Max, tmp+i);
    }
    return ans + Max;
}