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.
import java.lang.*;
import java.io.*;
import java.util.*;

// A U T H O R : s a n 1 d h y a
//Date : 07-06-2020 
public class B648 {
    static long Mod1 = 1000000007;

    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 ni() {
            return Integer.parseInt(next());
        }

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

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

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

    /*
     * public static void sortbyColumn(int arr[][], int col) { // Using built-in
     * sort function Arrays.sort Arrays.sort(arr, new Comparator<int[]>() {
     *
     * @Override // Compare values according to columns public int compare(final
     * int[] entry1, final int[] entry2) {
     *
     * // To sort in descending order revert // the '>' Operator if (entry1[col] >
     * entry2[col]) return 1; else return -1; } }); // End of function call sort().
     * }
     */
/*	public static long modex(long x, long y) {
		x = x % Mod1;
		long ret = 1;
		while (y > 0) {
			if (y % 2 != 0) {
				ret = ret * x % Mod1;
			}
			x = x * x % Mod1;
			y >>= 1;
		}
		return ret;
	}
*/
/*	public static long mplr(long x, long y) {
		long ret = 0;
		while (y != 0) {
			if (y % 2 != 0) {
				ret = (ret + x) % Mod1;
			}
			x = (x + x) % Mod1;
			y >>= 1;
		}
		return ret;
	}
*/
    public static void main(String[] args) {
        FastReader sc = new FastReader();
        int t = sc.ni();
        while (t-- > 0) {
        int  n=sc.ni();
        int a[][]=new  int[n][2];
        for(int i=0;i<n;i++){
            a[i][0]=sc.ni();

        }
        int  o=0,z=0;
            for(int i=0;i<n;i++){
                a[i][1]=sc.ni();
                if(a[i][1]==0)
                    z++;
                else
                    o++;

            }
            int f=0;
            for(int i=0;i<n-1;i++){
                if(a[i][0]>a[i+1][0]){
                    {
                        f=1;
                        break;
                    }
                }
            }




//            for(int i=0;i<n;i++){
//             System.out.print(a[i][0]+" ");
//            }
    if(f==0)
        System.out.println("Yes");
    else{
        if((o>0&&z>0))
        System.out.println("Yes");
        else
            System.out.println("No");

    }
        }
    }
}