P10961 Dividing Marbles

There are $a_1,a_2,\dots,a_6$ marbles with values $1,2,\dots,6$, respectively. Now you need to divide them into two parts so that the total value of the two parts is equal. Determine whether this is possible. The total number of marbles does not exceed $20000$.

This problem contains multiple test cases. Each test case is given in a single line with $6$ integers, which represent $a_1,a_2,\dots,a_6$. If all $6$ integers in a line are $0$, it indicates the end of the input file. For each test point, the number of valid test cases does not exceed $100$.

For each test case, if the division is successful, output `Can`; otherwise output `Can't`.

Translated by ChatGPT 5