Problem: You are given a binary string s consisting of n zeros and ones.

Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subsequence looks like "010101 ..." or "101010 ..." (i.e. the subsequence should not contain two adjacent zeros or ones).

Recall that a subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements. For example, subsequences of "1011101" are "0", "1", "11111", "0111", "101", "1001", but not "000", "101010" and "11100".

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of s. The second line of the test case contains n characters '0' and '1' — the string s.

It is guaranteed that the sum of n does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer: in the first line print one integer k (1 ≤ k ≤ n) — the minimum number of subsequences you can divide the string s to. In the second line print n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ k), where a_i is the number of subsequence the i-th character of s belongs to.

If there are several answers, you can print any.

Example

Input


4
4
0011
6
111111
5
10101
8
01010000


Output


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

Solution (in JAVA):

Solution:
// Working program using Reader Class 
import java.io.*; 
import java.lang.*; 
import java.util.*; 

public class Solution
{ 
	static class Reader 
	{ 
		final private int BUFFER_SIZE = 1 << 16; 
		private DataInputStream din; 
		private byte[] buffer; 
		private int bufferPointer, bytesRead; 

		public Reader() 
		{ 
			din = new DataInputStream(System.in); 
			buffer = new byte[BUFFER_SIZE]; 
			bufferPointer = bytesRead = 0; 
		} 

		public Reader(String file_name) throws IOException 
		{ 
			din = new DataInputStream(new FileInputStream(file_name)); 
			buffer = new byte[BUFFER_SIZE]; 
			bufferPointer = bytesRead = 0; 
		} 

		public String readLine() throws IOException 
		{ 
			byte[] buf = new byte[64]; // line length 
			int cnt = 0, c; 
			while ((c = read()) != -1) 
			{ 
				if (c == '\n') 
					break; 
				buf[cnt++] = (byte) c; 
			} 
			return new String(buf, 0, cnt); 
		} 

		public int nextInt() throws IOException 
		{ 
			int ret = 0; 
			byte c = read(); 
			while (c <= ' ') 
				c = read(); 
			boolean neg = (c == '-'); 
			if (neg) 
				c = read(); 
			do
			{ 
				ret = ret * 10 + c - '0'; 
			} while ((c = read()) >= '0' && c <= '9'); 

			if (neg) 
				return -ret; 
			return ret; 
		} 

		public long nextLong() throws IOException 
		{ 
			long ret = 0; 
			byte c = read(); 
			while (c <= ' ') 
				c = read(); 
			boolean neg = (c == '-'); 
			if (neg) 
				c = read(); 
			do { 
				ret = ret * 10 + c - '0'; 
			} 
			while ((c = read()) >= '0' && c <= '9'); 
			if (neg) 
				return -ret; 
			return ret; 
		} 

		public double nextDouble() throws IOException 
		{ 
			double ret = 0, div = 1; 
			byte c = read(); 
			while (c <= ' ') 
				c = read(); 
			boolean neg = (c == '-'); 
			if (neg) 
				c = read(); 

			do { 
				ret = ret * 10 + c - '0'; 
			} 
			while ((c = read()) >= '0' && c <= '9'); 

			if (c == '.') 
			{ 
				while ((c = read()) >= '0' && c <= '9') 
				{ 
					ret += (c - '0') / (div *= 10); 
				} 
			} 

			if (neg) 
				return -ret; 
			return ret; 
		} 

		private void fillBuffer() throws IOException 
		{ 
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
			if (bytesRead == -1) 
				buffer[0] = -1; 
		} 

		private byte read() throws IOException 
		{ 
			if (bufferPointer == bytesRead) 
				fillBuffer(); 
			return buffer[bufferPointer++]; 
		} 

		public void close() throws IOException 
		{ 
			if (din == null) 
				return; 
			din.close(); 
		} 
    } 
    

	public static void main(String[] args) throws IOException 
	{ 
		Scanner sc=new Scanner(System.in);
        //Reader sc=new Reader();
        PrintWriter out=new PrintWriter(System.out);
		int t=sc.nextInt();
		int index=1;
        while(t-->0){
            int n=sc.nextInt();
            char a[]=sc.next().toCharArray();
            int sn[]=new int[n];
			TreeSet<Integer> one=new TreeSet<Integer>(),zero=new TreeSet<Integer>();
			for(int i=0;i<n;i++){
				if(a[i]=='0')zero.add(i);
				else one.add(i);
			}
			int grp=0;
			while(!(zero.isEmpty()&&one.isEmpty())){
				grp++;
				if(zero.isEmpty()){
					sn[one.pollFirst()]=grp;
				}else if(one.isEmpty()){
					sn[zero.pollFirst()]=grp;
				}else{
					int x=zero.first(),y=one.first();
					int need=0;
					if(y<x)need=1;
					int prev=-1;
					while(true){
						if(need==0){
							if(zero.isEmpty()||zero.higher(prev)==null)break;
							Integer next=zero.higher(prev);
							sn[next]=grp;
							zero.remove(next);
							prev=next;
						}else{
							if(one.isEmpty()||one.higher(prev)==null)break;
							Integer next=one.higher(prev);
							sn[next]=grp;
							one.remove(next);
							prev=next;
						}
						need^=1;
					}
				}
			}
            out.println(grp);
            for(int i=0;i<n;i++) out.print( sn[i]+" ");
            out.println();
        }
        out.flush();
	}
}
class DSU{
	int p[];
	DSU(int n){
		p=new int[n];
		for(int i=0;i<n;i++){
			p[i]=-1;
		}
	}
	int find(int u){
		if(p[u]<0)return u;
		return p[u]=find(p[u]);
	}
	void union(int a,int b){
		int u=find(a),v=find(b);
		if(u==v)return;
		if(p[u]>p[v]){
			int temp=u;
			u=v;
			v=temp;
		}
		p[v]+=p[u];
		p[u]=v;
	}
}
class SegmentTree{
	long t[];
	SegmentTree(int n){
		t=new long[n*4];
	}
	void build(long a[],int v,int tl,int tr){
		if(tl==tr){
			t[v]=a[tl];
		}else{
			int tm=(tl+tr)/2;
			build(a,2*v,tl,tm);
			build(a,2*v+1,tm+1,tr);
			t[v]=t[2*v]+t[2*v+1];
		}
	}
	void update(int v,int tl,int tr,int pos,int val){
		if(tl==tr){
			t[v]=val;
		}else{
			int tm=(tl+tr)/2;
			if(pos<=tm)
				update(2*v,tl,tm,pos,val);
			else
				update(2*v+1,tm+1,tr,pos,val);
			t[v]=t[2*v]+t[2*v+1];
		}
	}
	long sum(int v,int tl,int tr,int l,int r){
		if(l>r)
			return 0;
		if(tl==l&&tr==r)
			return t[v];
		int tm=(tl+tr)/2;
		return sum(2*v,tl,tm,l,Integer.min(r,tm))+
			   sum(2*v+1,tm+1,tr,Integer.max(l,tm+1),r);
	}
}