A. Sweet Problem

Each day Tanya eats exactly two candies of different colors. She is free to choose the colors of eaten candies: the only restriction that she can't eat two candies of the same color in a day.

Find the maximal number of days Tanya can eat candies? Each day she needs to eat exactly two candies.

Input

The first line contains integer tt (1≤t≤10001≤t≤1000) — the number of test cases in the input. Then tt test cases follow.

Each test case is given as a separate line of the input. It contains three integers rr, gg and bb (1≤r,g,b≤1081≤r,g,b≤108) — the number of red, green and blue candies, respectively.

Output

Print tt integers: the ii-th printed integer is the answer on the ii-th test case in the input.

Example

input

Copy

6
1 1 1
1 2 1
4 1 1
7 4 10
8 1 4
8 2 8

output

Copy

1
2
2
10
5
9

Note

In the first example, Tanya can eat candies for one day only. She can eat any pair of candies this day because all of them have different colors.

In the second example, Tanya can eat candies for two days. For example, she can eat red and green candies on the first day, and green and blue candies on the second day.

In the third example, Tanya can eat candies for two days. For example, she can eat red and green candies on the first day, and red and blue candies on the second day. Note, that two red candies will remain uneaten.

题意：

有几个蜡烛每次用的时候只能用不同的两个比如用a1只b1只问最少剩几只不能用，

思路：如果最大的大与其他两个之和就输出其他两个之和否则就用最小的填补两数之差多的除二因为可以最小和次小配对再和最大配对

代码：

#include<bits/stdc++.h>
using namespace std;
int a[10];
int main() {
	int t;
	scanf("%d", &t);
	while(t--) {
		scanf("%d%d%d", &a[1], &a[2], &a[3]);
		sort(a+1, a+4);
		int h = a[3] - a[2];
		if(h-a[1] >= 0) {
			printf("%d\n", a[1]+a[2]);
		}
		else {
			int z = a[1]-h;
			z >>= 1;
			printf("%d\n", z + a[3]);
		}	
	}
	
	return 0;
}