#include <iostream>
#include <vector>
#include <cmath>
#include <fcntl.h>
#include <unistd.h>
#include <algorithm>

using namespace std;

int rails[10];
int best[5], best_cnt;
vector<int> v;

void search_sol(int depth, int n)
{
	if (depth >= best_cnt)
		return;

	bool better = true;
	
	for (int i=0; (i<n) && better; i++)
	{	
		for (int j=0; j<depth; j++)
		for (int k=j+1; k<depth; k++)
			if (abs(rails[j]-rails[k])==v[i])
			{
				goto next;
			}
		better = false;
		break;
		next:;
	}

	if (better)
	{
		best_cnt = depth;
		for (int i=0; i<depth; i++)
			best[i] = rails[i];
	}

	if (depth==5)
		return;
	
	for (int i=0; i<depth; i++)
	for (int j=0; j<n; j++)
	{
		rails[depth] = rails[i] + v[j];
		search_sol(depth+1, n);
		if (rails[i] - v[j] > 0)
		{
			rails[depth] = rails[i] - v[j];
			search_sol(depth+1, n);
		}
	}
}


int main()
{
	close(0);
	open("european.in", O_RDONLY);
	int kase;
	scanf("%d", &kase);
	for (int j=1; j<=kase; j++)
	{
		int n, g;
		scanf("%d", &n);
		v.clear();
		rails[0] = 0;
		best_cnt = 100;

		for (int i=0; i<n; i++)
		{
			scanf("%d", &g);
			v.push_back(g);
		}
		search_sol(1, n);
		printf("Scenario #%d\n", j);
		printf("%d:", best_cnt);
		sort(best, best+best_cnt);
		for (int i=0; i<best_cnt; i++)
			printf(" %d", best[i]);
		printf("\n\n");
		
	}
}