#include<iostream>

 #include<string>

 #include<cstring>

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 const int maxn = ;

 int sum;

 int a[];

 int d[maxn];

 int w[maxn];

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int kase = ;

     while (scanf("%d", &a[]))

     {

         for (int i = ; i <= ; i++)

             scanf("%d", &a[i]);

         sum = ;

         for (int i = ; i <= ; i++)

             sum += i*a[i];

         if (sum == )  break;

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

         if (sum % )

         {

             printf("Can't be divided.\n\n");

             continue;

         }

         int count = ;

         for (int i = ; i <= ; i++)

         {

             int m = a[i];

             int k = ;

             while (k < m)

             {

                 w[count++] = k*i;

                 m -= k;

                 k *= ;

             }

             w[count++] = m*i;

         }

         sum = sum / ;

         memset(d, , sizeof(d));

         for (int i = ; i < count; i++)

         {

             for (int j = sum; j >= w[i]; j--)

                 d[j] = max(d[j], d[j - w[i]] + w[i]);

         }

         if (d[sum]==sum)

             printf("Can be divided.\n\n");

         else

             printf("Can't be divided.\n\n");

     }

 }