Given n elements in an array.

You are required to sort the array in non-decreasing order the value of the element.

The elements are represented by two integers

a_i – the value of the element

b_i – the type of the element {0 or 1}.

He can do so by performing below operation any no of times:

• Select any two indices i and j such that b_i ≠ b_i and | i-j | = 1 and swap them. (That is you can select any two adjacent elements and swap them if they both are of a different type).

Can you sort the elements in non-decreasing order?

INPUT:

The first line contains one integer t(1 ≤ t ≤ 20) — 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 ≤ 10⁵) — the size of the arrays.

The second line contains n integers a_i(1 ≤ a_i ≤ 10⁵)  — 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.

30% of test cases- (1 ≤ n ≤ 10³ )

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.

Print each letter in Upper case only.