Problem: The round carousel consists of n figures of animals. Figures are numbered from 1 to n in order of the carousel moving. Thus, after the n-th figure the figure with the number 1 follows. Each figure has its own type — the type of the animal corresponding to this figure (the horse, the tiger and so on). The type of animal of the i-th figure equals t_i.

<image> The example of the carousel for n=9 and t=[5, 5, 1, 15, 1, 5, 5, 1, 1]. 

You want to color each figure in one of the colors. You think that it's boring if the carousel contains two different figures (with the distinct types of animals) going one right after another and colored in the same color.

Your task is to color the figures in such a way that the number of distinct colors used is the minimum possible and there are no figures of the different types going one right after another and colored in the same color. If you use exactly k distinct colors, then the colors of figures should be denoted with integers from 1 to k.

Input

The input contains one or more test cases.

The first line contains one integer q (1 ≤ q ≤ 10^4) — the number of test cases in the test. Then q test cases follow. One test case is given on two lines.

The first line of the test case contains one integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the number of figures in the carousel. Figures are numbered from 1 to n in order of carousel moving. Assume that after the n-th figure the figure 1 goes.

The second line of the test case contains n integers t_1, t_2, ..., t_n (1 ≤ t_i ≤ 2 ⋅ 10^5), where t_i is the type of the animal of the i-th figure.

The sum of n over all test cases does not exceed 2⋅10^5.

Output

Print q answers, for each test case print two lines.

In the first line print one integer k — the minimum possible number of distinct colors of figures.

In the second line print n integers c_1, c_2, ..., c_n (1 ≤ c_i ≤ k), where c_i is the color of the i-th figure. If there are several answers, you can print any.

Example

Input


4
5
1 2 1 2 2
6
1 2 2 1 2 2
5
1 2 1 2 3
3
10 10 10


Output


2
1 2 1 2 2
2
2 1 2 1 2 1
3
2 3 2 3 1
1
1 1 1 

Solution (in JAVA):

Solution:


import java.util.HashMap;
import java.util.Scanner;

public class C {
	static int mod = 1000000007;

	public static void main(String[] args) {

		Scanner nik = new Scanner(System.in);
		int t = nik.nextInt();
		StringBuilder st = new StringBuilder();
		while (t-- > 0) {
			int n = nik.nextInt();
			int[] a = new int[n];

			for (int i = 0; i < n; i++) {
				a[i] = nik.nextInt();
			}

			int[] dp = new int[n + 1];
			dp[0] = 1;
			dp[n] = 1;
			int max = 1;
			for (int i = 1; i < n; i++) {

				if (dp[i - 1] != 1 || a[i] == a[i - 1]) {
					dp[i] = 1;
				} else {
					dp[i] = 2;
				}
				max = max > dp[i] ? max : dp[i];
			}

			if (a[n - 1] != a[0] && dp[n - 1] == 1) {

				if (dp[1] != 2) {
					dp[0] = 2;
				} else {
					dp[n - 1] = 3;
					max = 3;
				}

			}

			int nmax = 1;

			int[] b = new int[n];
			b[0] = 2;
			for (int i = 1; i < n; i++) {

				if (a[i] == a[i - 1] || b[i - 1] == 2) {
					b[i] = 1;
				} else {
					b[i] = 2;
				}

			}

			if (a[n - 1] == a[0] && b[n - 1] == 1 && a[1]==a[0]) {
				b[0] = 1;
			}
			for (int i = 0; i < n; i++) {
				nmax = b[i] > nmax ? b[i] : nmax;
			}
			if (a[n - 1] != a[0] && b[n - 1] == 2) {

				if (a[1] == a[0]) {
					b[0] = 1;
				} else {
					b[n - 1] = 3;
					nmax = 3;
				}

			}
			if (nmax > max) {
				st.append(max + "\n");
				for (int i = 0; i < n; i++) {
					st.append(dp[i] + " ");
				}
				st.append("\n");
			} else {
				st.append(nmax + "\n");
				for (int i = 0; i < n; i++) {
					st.append(b[i] + " ");
				}
				st.append("\n");
			}
		}
		System.out.println(st);
	}
}