C. Paint the Digits

C. Paint the Digits

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a sequence of nn digits d1d2…dnd1d2…dn. You need to paint all the digits in two colors so that:

• each digit is painted either in the color 11 or in the color 22;
• if you write in a row from left to right all the digits painted in the color 11, and then after them all the digits painted in the color 22, then the resulting sequence of nn digits will be non-decreasing (that is, each next digit will be greater than or equal to the previous digit).

For example, for the sequence d=914d=914 the only valid coloring is 211211 (paint in the color 11 two last digits, paint in the color 22 the first digit). But 122122 is not a valid coloring (99 concatenated with 1414 is not a non-decreasing sequence).

It is allowed that either of the two colors is not used at all. Digits painted in the same color are not required to have consecutive positions.

Find any of the valid ways to paint the given sequence of digits or determine that it is impossible to do.

Input

The first line contains a single integer tt (1≤t≤100001≤t≤10000) — the number of test cases in the input.

The first line of each test case contains an integer nn (1≤n≤2⋅1051≤n≤2⋅105) — the length of a given sequence of digits.

The next line contains a sequence of nn digits d1d2…dnd1d2…dn (0≤di≤90≤di≤9). The digits are written in a row without spaces or any other separators. The sequence can start with 0.

It is guaranteed that the sum of the values ​​of nn for all test cases in the input does not exceed 2⋅1052⋅105.

Output

Print tt lines — the answers to each of the test cases in the input.

If there is a solution for a test case, the corresponding output line should contain any of the valid colorings written as a string of nn digits t1t2…tnt1t2…tn (1≤ti≤21≤ti≤2), where titi is the color the ii-th digit is painted in. If there are several feasible solutions, print any of them.

If there is no solution, then the corresponding output line should contain a single character '-' (the minus sign).

Example

input

Copy

5
12
040425524644
1
0
9
123456789
2
98
3
987

output

Copy

121212211211
1
222222222
21
-

Note

In the first test case, d=040425524644d=040425524644. The output t=121212211211t=121212211211 is correct because 00224440022444 (painted in 11) concatenated with 4455644556 (painted in 22) is 002244444556002244444556 which is a sorted sequence of nn given digits.

=========================================================================

六个字

排序 指针 扫描

# include <stdio.h>
#include<iostream>
# include<cstring>
# include<vector>
# include<queue>
# include<algorithm>
using namespace std;
typedef long long int ll;

int a[200000+10];

int ans[200000+10];
int main()
{

    int t;

    cin>>t;
    while(t--)
    {
        int n;

        cin>>n;

        string s;

        cin>>s;

        s=" "+s;

        for(int i=1; i<=n; i++)
        {
            a[i]=s[i]-'0';

            ans[i]=0;
        }

        sort(a+1,a+1+n);

        int left=1;

        for(int i=1;i<=n;i++)
        {

            if(left==n+1)
                continue;

            if(s[i]-'0'==a[left])
            {
                ans[i]=1;

                left++;
            }

        }


       for(int i=1;i<=n;i++)
       {
           if(ans[i])
            continue;

            if(left==n+1)
                continue;

           if(s[i]-'0'==a[left])
           {
               ans[i]=2;
               left++;

           }
       }


       if(left==n+1)
       {
           for(int i=1;i<=n;i++)
           {
               cout<<ans[i];
           }
           cout<<endl;
       }
       else
       {
           cout<<'-'<<endl;
       }

    }



    return  0;
}