Ashish has n elements arranged in a line. 

These elements are represented by two integers a_i — the value of the element and b_i — the type of the element (there are only two possible types: 0 and 1). He wants to sort the elements in non-decreasing values of a_i.

He can perform the following operation any number of times: 

  * Select any two elements i and j such that b_i ≠ b_j and swap them. That is, he can only swap two elements of different types in one move. 



Tell him if he can sort the elements in non-decreasing values of a_i after performing any number of operations.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains one integer n (1 ≤ n ≤ 500) — the size of the arrays.

The second line contains n integers a_i (1 ≤ a_i ≤ 10^5) — the value of the i-th element.

The third line containts n integers b_i (b_i ∈ \{0, 1\}) — the type of the i-th element.

Output

For each test case, print "Yes" or "No" (without quotes) depending on whether it is possible to sort elements in non-decreasing order of their value.

You may print each letter in any case (upper or lower).

Example

Input


5
4
10 20 20 30
0 1 0 1
3
3 1 2
0 1 1
4
2 2 4 8
1 1 1 1
3
5 15 4
0 0 0
4
20 10 100 50
1 0 0 1


Output


Yes
Yes
Yes
No
Yes

Note

For the first case: The elements are already in sorted order.

For the second case: Ashish may first swap elements at positions 1 and 2, then swap elements at positions 2 and 3.

For the third case: The elements are already in sorted order.

For the fourth case: No swap operations may be performed as there is no pair of elements i and j such that b_i ≠ b_j. The elements cannot be sorted.

For the fifth case: Ashish may swap elements at positions 3 and 4, then elements at positions 1 and 2.
'''
def merge(arr, l, m, r, z): 
    n1 = m - l + 1
    n2 = r- m 
  
    L = [0] * (n1)
    Lz = [0] * (n1)
    R = [0] * (n2)
    Rz = [0] * (n2)
  
    for i in range(0 , n1): 
        L[i] = arr[l + i]
        Lz[i] = z[l + i]
  
    for j in range(0 , n2): 
        R[j] = arr[m + 1 + j]
        Rz[j] = z[m + 1 + j]
  
    i = 0    
    j = 0     
    k = l     
  
    while i < n1 and j < n2 : 
        if L[i] <= R[j] and Lz[i]!=Rz[j]: 
            arr[k] = L[i]
            z[k]=Lz[i]
            i += 1
        else: 
            arr[k] = R[j] 
            z[k]=Rz[j]
            j += 1
        k += 1
  
    while i < n1: 
        arr[k] = L[i]
        z[k]= Lz[i]
        i += 1
        k += 1
  
    while j < n2: 
        arr[k] = R[j]
        z[k]=Rz[j]
        j += 1
        k += 1
        
def mSort(arr,l,r,z): 
    if l < r: 
        m = (l+(r-1))//2
        mSort(arr, l, m, z) 
        mSort(arr, m+1, r, z) 
        merge(arr, l, m, r, z)


def bsort(arr,z): 
    n = len(arr) 
    for i in range(n): 
        for j in range(0, n-i-1): 
            if arr[j] > arr[j+1] and z[j]!=z[j+1] : 
                arr[j], arr[j+1] = arr[j+1], arr[j]
                z[j],z[j+1]=z[j+1],z[j]
'''
t=int(input())
while t>0:
    t-=1
    n=int(input())
    arr1=list(map(int,input().split()))
    arr2=list(map(int,input().split()))
    one=0
    for i in arr2:
    	if i==1:
    		one+=1
    if one==0 or one==len(arr2):
    	sx=sorted(arr1)
    	if sx==arr1 or arr1==sx[::-1]:
    		print('Yes')
    	else:
    		print('No')
    else:
    	print('Yes')
