B"A positive integer is called composite if it can be represented as a product of two positive integers, both greater than 1 . For example, the following numbers are composite: 6 , 4 , 120 , 27 . The following numbers aren't: 1 , 2 , 3 , 17 , 97 . Alice is given a sequence of n composite numbers a_1,a_2, ldots,a_n . She wants to choose an integer m <= 11 and color each element one of m colors from 1 to m so that: Note that equal elements can be colored different colors -- you just have to choose one of m colors for each of the indices from 1 to n . Alice showed already that if all a_i <= 1000 then she can always solve the task by choosing some m <= 11 . Help Alice to find the required coloring. Note that you don't have to minimize or maximize the number of colors, you just have to find the solution with some m from 1 to 11 . The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. Then the descriptions of the test cases follow. The first line of the test case contains a single integer n ( 1 <= n <= 1000 ) -- the amount of numbers in a sequence a . The second line of the test case contains n composite integers a_1,a_2, ldots,a_n ( 4 <= a_i <= 1000 ). It is guaranteed that the sum of n over all test cases doesn't exceed 10^4 . For each test case print 2 lines. The first line should contain a single integer m ( 1 <= m <= 11 ) -- the number of used colors. Consider colors to be numbered from 1 to m . The second line should contain any coloring that satisfies the above conditions. Print n integers c_1, c_2, ... , c_n ( 1 <= c_i <= m ), where c_i is the color of the i -th element. If there are multiple solutions then you can print any of them. Note that you don't have to minimize "...