#include <stdio.h>

int dfs(int *n, int val, int max)
{
	int i = 0 ;

	if(0 == val)
		return 1 ;

	for(i = max; i > 0; i--)
	{
		if(!n[i-1] || val < i)
			continue ;
		
		n[i-1]-- ;
		if(dfs(n, val - i, i))
			return 1 ;
	}

	return 0 ;
}

int main(int argc, char *argv[])
{
	int  n[6] = {0} ;
	int  cnt = 0 ;
	int  i = 0 ;
	int  sum = 0 ;

	while(1)
	{
		sum = 0 ;
		for(i = 0; i < 6; i++)
		{
			scanf("%d ", &n[i]) ;
			
			/* 神奇剪枝 */
			/* n[i] %= 60 ; */

			sum += n[i] * (i+1) ;
		}
		if(0 == sum)
			break ;

		printf("Collection #%d:\r\n", ++cnt) ;

		if((sum % 2) || (0 == dfs(n, sum/2, 6)))
			printf("Can't be divided.\r\n\r\n") ;
		else
			printf("Can be divided.\r\n\r\n") ;
	}

	return 0 ;
}