Problem: Polycarp has 26 tasks. Each task is designated by a capital letter of the Latin alphabet.

The teacher asked Polycarp to solve tasks in the following way: if Polycarp began to solve some task, then he must solve it to the end, without being distracted by another task. After switching to another task, Polycarp cannot return to the previous task.

Polycarp can only solve one task during the day. Every day he wrote down what task he solved. Now the teacher wants to know if Polycarp followed his advice.

For example, if Polycarp solved tasks in the following order: "DDBBCCCBBEZ", then the teacher will see that on the third day Polycarp began to solve the task 'B', then on the fifth day he got distracted and began to solve the task 'C', on the eighth day Polycarp returned to the task 'B'. Other examples of when the teacher is suspicious: "BAB", "AABBCCDDEEBZZ" and "AAAAZAAAAA".

If Polycarp solved the tasks as follows: "FFGZZZY", then the teacher cannot have any suspicions. Please note that Polycarp is not obligated to solve all tasks. Other examples of when the teacher doesn't have any suspicious: "BA", "AFFFCC" and "YYYYY".

Help Polycarp find out if his teacher might be suspicious.

Input

The first line contains an integer t (1 ≤ t ≤ 1000). Then t test cases follow.

The first line of each test case contains one integer n (1 ≤ n ≤ 50) — the number of days during which Polycarp solved tasks.

The second line contains a string of length n, consisting of uppercase Latin letters, which is the order in which Polycarp solved the tasks.

Output

For each test case output: 

  * "YES", if the teacher cannot be suspicious; 
  * "NO", otherwise. 



You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

Example

Input


5
3
ABA
11
DDBBCCCBBEZ
7
FFGZZZY
1
Z
2
AB


Output


NO
NO
YES
YES
YES

Solution (in JAVA):

Solution:
///package codeforces;
import java.util.*;
import java.lang.*;
import java.io.*;
public class B_719 {
static class FastReader {
	BufferedReader br;
	StringTokenizer st;

	public FastReader() {
		br = new BufferedReader(new InputStreamReader(System.in));
	}

	String next() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	int nextInt() {
		return Integer.parseInt(next());
	}

	long nextLong() {
		return Long.parseLong(next());
	}

	double nextDouble() {
		return Double.parseDouble(next());
	}

	String nextLine() {
		String str = "";
		try {
			str = br.readLine();
		} catch (IOException e) {
			e.printStackTrace();
		}
		return str;
	}

	int[] readArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		return a;
	}
}

static void ruffle_sort(int[] a) {
	//shandom_ruffle
	Random r = new Random();
	int n = a.length;
	for (int i = 0; i < n; i++) {
		int oi = r.nextInt(n);
		int temp = a[i];
		a[i] = a[oi];
		a[oi] = temp;
	}

	//sort
	Arrays.sort(a);
}

static int hcf(int a, int b) {
	if (b == 0)
		return a;
	return hcf(b, a % b);
}

static int pow(int a, int b) {
	int ans = 1;
	while (b > 0) {
		if ((b & 1) != 0)
			ans *= a;

		a = a * a;
		b = b >> 1;
	}
	return ans;
}

static void prime(List<Integer> prime, int n) {

	boolean arr[] = new boolean[n + 1];
	Arrays.fill(arr, true);
	arr[0] = arr[1] = false;
	for (int i = 2; i * i <= n; i++) {
		if (arr[i] == true) {
			//prime.add(i);
			for (int j = i * i; j < arr.length; j += i)
				arr[j] = false;
		}
	}
	for (int i = 0; i < arr.length; i++) {
		if (arr[i] == true)
			prime.add(i);
	}

}

public static void main(String[] args) throws java.lang.Exception {
	try {
		FastReader sc = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int t = sc.nextInt();
		while (t-- > 0) {
			int n = sc.nextInt();
			String s=sc.next();
			char ch[]=s.toCharArray();
			if(solve(n,ch))
				System.out.println("YES");
			else
				System.out.println("NO");
		
		}
		out.close();
	} catch (Exception e) {
	} finally {
		return;
	}
}

private static boolean solve(int n, char ch[]) {
	HashSet<Character> hs=new HashSet<>();
	for(int i=0;i<n;)
	{
		if(hs.contains(ch[i]))
			{
			return false;
			}
		else {
			hs.add(ch[i]);
			i++;
			for(int j=i;j<n && ch[j]==ch[j-1] ;j++)
			{
				i++;
			}
			//System.out.println(i);
		}
	}
	return true;
	
}

}