#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < int(n); i++)

int main() {
    int t;
    cin >> t;
    forn(tt, t) {   
        int a[3];
        cin >> a[0] >> a[1] >> a[2];
        sort(a, a + 3);
        if (a[2] <= a[0] + a[1])
            cout << (a[0] + a[1] + a[2]) / 2 << endl;
        else
            cout << a[0] + a[1] << endl;
    }
}

#include <bits/stdc++.h>
using namespace std;

void solve() {
	int n;
	cin >> n;

	vector<char> calced(n);
	vector<string> a(n);
	set<string> have;
	int res = 0;

	for (string &pin : a) {
		cin >> pin;
		have.insert(pin);
	}

	for (int i = 0; i < n; i++) {
		if (calced[i]) {
			continue;
		}

		vector<int> sameIds;

		for (int j = i + 1; j < n; j++) {
			if (a[i] == a[j]) {
				sameIds.push_back(j);
				calced[j] = 1;
				res++;

				for (int k = 0; k < 4 && a[i] == a[j]; k++) {
					for (char c = '0'; c <= '9'; c++) {
						string t = a[j];
						t[k] = c;

						if (!have.count(t)) {
							have.insert(t);
							a[j] = t;
							break;
						}
					}
				}
			}
		}
	}

	cout << res << "\n";

	for (string& s : a) {
		cout << s << "\n";
	}
}

int main() {
	int test;
	cin >> test;

	while (test--) {
		solve();
	}
}

// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#define ALL(s) (s).begin(), (s).end()
#define rALL(s) (s).rbegin(), (s).rend()
#define sz(s) (int)(s).size()
#define mkp make_pair
#define pb push_back
#define sqr(s) ((s) * (s))

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int ui;

#ifdef EUGENE
	mt19937 rng(1337);
#else
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif

void solve() {
	int n;
	cin >> n;
	vector<int> ans;
	int s = (int)sqrtl(n);
	for (int i = 0; i <= s; i++)
		ans.pb(i);
	for (int i = 1; i <= s; i++)
		ans.pb(n / i);
	sort(ALL(ans));
	ans.resize(unique(ALL(ans)) - ans.begin());
	cout << sz(ans) << endl;
	for (int &x : ans)
		cout << x << " ";
	cout << endl;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	#ifdef EUGENE
		freopen("input.txt", "r", stdin);
		// freopen("output.txt", "r", stdout);
	#endif

	int t;
	cin >> t;
	while (t--)
		solve();
}

#include <bits/stdc++.h>
using namespace std;

const int N = (int)2e5 + 100;

vector<int> g[N];
char used[N];

void addEdge(int v, int u) {
	g[v].push_back(u);
	g[u].push_back(v);
}

void dfs(int v) {
	used[v] = 1;

	for (int to : g[v]) {
		if (!used[to]) {
			dfs(to);
		}
	}
}

int main() {
	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;

		for (char c : s) {
			addEdge(i, n + c - 'a');
		}
	}

	int res = 0;

	for (int i = n; i < n + 26; i++) {
		if (!g[i].empty() && !used[i]) {
			dfs(i);
			res++;
		}
	}

	cout << res;

	return 0;
}

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

struct MyStack {
    int cnt = 0;
    int allOpens = 0;
    stack<int> s;
    stack<int> minValue;
    stack<int> maxValue;

    void push(int x) {
        s.push(x);
        cnt += x;
        if (x == 1) {
            allOpens += 1;
        }
        minValue.push((minValue.size() ? min(minValue.top(), cnt) : cnt));
        maxValue.push((maxValue.size() ? max(maxValue.top(), cnt) : cnt));
    }

    void pop() {
        if (s.size() == 0) {
            return;
        }
        cnt -= s.top();
        if (s.top() == 1) {
            allOpens -= 1;
        }
        s.pop();
        minValue.pop();
        maxValue.pop();
    }

    int top() {
        return s.top();
    }

    bool isCorrect() {
        return (minValue.size() == 0 || minValue.top() >= 0);
    }

    int depth() {
        return (maxValue.size() ? maxValue.top() : 0);
    }
};

int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    MyStack left, right;
    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        right.push(0);
    }
    left.push(0);
    int pos = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'L') {
            if (pos != 0) {
                pos--;
                right.push(-left.top());
                left.pop();
            }
        } else if (s[i] == 'R') {
            pos++;
            left.push(-right.top());
            right.pop();
        } else if (s[i] == '(') {
            left.pop();
            left.push(1);
        } else if (s[i] == ')') {
            left.pop();
            left.push(-1);
        } else {
            left.pop();
            left.push(0);
        }
        if (left.isCorrect() && right.isCorrect() && left.cnt == right.cnt) {
            cout << max({left.depth(), right.depth(), left.cnt}) << " ";
        } else {
            cout << "-1 ";
        }
    }
}           	

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define sz(x) int((x).size())
#define all(x) begin(x), end(x)

#ifdef LOCAL
    #define eprint(x) cerr << #x << " = " << (x) << endl
    #define eprintf(args...) fprintf(stderr, args), fflush(stderr)
#else
    #define eprint(x)
    #define eprintf(...)
#endif

vector<vector<int>> precalc(int n, vector<int> p, vector<int> id) {
    vector<vector<int>> res(n, vector<int>(n));

    for (int l = 0; l < n; l++) {
        vector<int> deg(sz(p));
        for (int i = 1; i < sz(p); i++)
            deg[p[i]]++;

        int val = 0;
        for (int r = l; r < n; r++) {
            int v = id[r];
            while (v != 0 && deg[v] == 0) {
                deg[p[v]]--;
                v = p[v];
                val++;
            }
            res[l][r] = val;
        }
    }

    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<vector<int>> p(2);
    vector<vector<int>> id(2);
    for (int i = 0; i < 2; i++) {
        int vn;
        cin >> vn;
        p[i].resize(vn);
        for (int v = 1; v < vn; v++) {
            cin >> p[i][v];
            p[i][v]--;
        }
        id[i].resize(n);
        for (int j = 0; j < n; j++) {
            cin >> id[i][j];
            id[i][j]--;
        }
    }

    vector<vector<vector<int>>> cost(2);
    for (int i = 0; i < 2; i++)
        cost[i] = precalc(n, p[i], id[i]);

    vector<int> dp(n + 1);
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j <= n; j++) {
            dp[j] = max(dp[j], dp[i] + max(
                cost[0][i][j - 1],
                cost[1][i][j - 1]
            ));
        }
    }

    cout << dp[n] << endl;
}