Problem: 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e2 + 10;
const long long mod = 1e9 + 7;
struct po {
  int va, tp;
};
po in[maxn], cop[maxn];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, s1 = -1, s2 = -1;
    scanf("%d", &n);
    bool v0 = false, v1 = false, ok = true;
    for (int i = 0; i < n; ++i) {
      scanf("%d", &in[i].va);
    }
    for (int i = 0; i < n; ++i) {
      scanf("%d", &in[i].tp);
    }
    for (int j = 0; j < n; ++j) {
      if (!v0 && in[j].tp == 0) {
        v0 = true;
        s1 = in[j].va;
      } else if (!v1 && in[j].tp == 1) {
        v1 = true;
        s2 = in[j].va;
      }
    }
    for (int k = 0; k < n; ++k) {
      if (in[k].tp == 0) {
        if (in[k].va >= s1)
          s1 = in[k].va;
        else {
          ok = false;
          break;
        }
      } else {
        if (in[k].va >= s2)
          s2 = in[k].va;
        else {
          ok = false;
          break;
        }
      }
    }
    if (ok || (v0 && v1)) {
      printf("Yes\n");
    } else
      printf("No\n");
  }
}