Panda and his friends were hiking in the forest. They came across a coffee bar inside a giant tree trunk.
Panda decided to treat everyone a cup of coffee and have some rest. Mr. Buck, the bartender greeted Panda and his animal friends with his antler. He proudly told them that his coffee is the best in the forest and this bar is a Michelin-starred bar, thats why the bar is called Starred Bucks.
There was a campaign running at the coffee bar: for every 3 cups of coffee, the cheapest one is FREE. After asking all his friends for their flavors, Panda wondered how much he need to pay.

The first line of the input gives the number of test cases, T.
T test cases follow. Each test case consists of two lines. The first line contains one integer N, the number of cups to be bought.
The second line contains N integers p1,p2,⋅⋅⋅,pN representing the prices of each cup of coffee.

For each test case, output one line containing “Case #x: y”, where x is the test case number (starting from 1) and y is the least amount of money Panda need to pay.

limits

∙ 1 ≤ T ≤ 100.
∙ 1 ≤ N ≤ 105.
∙ 1 ≤ pi ≤ 1000.

#include<stdio.h>
#include<algorithm>
using namespace std;

bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int T, N;
	int pi[100005];
	scanf("%d", &T);
	int n = 0;
	while (T--)
	{
		n++;
		int sum = 0;
		scanf("%d", &N);
		for (int i = 0; i < N; i++)
		{
			scanf("%d", &pi[i]);
		}
		sort(pi, pi + N,cmp);
		for (int i = 0; i < N; i++)
		{
			if ((i + 1) % 3 != 0)
			{
				sum+=pi[i];
			}
		}
		printf("Case #%d: %d\n", n, sum);
	}
	return 0;
}