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.
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e19 + 7;
const int maxn = 1e6 + 10;
const double eps = 1e-9;
double random(double start, double en) {
  return start + (en - start) * rand() / (RAND_MAX + 1.0);
}
inline void read(int &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  x *= f;
}
inline void out(int x) {
  if (x >= 10) out(x / 10);
  putchar(x % 10 + '0');
}
long long qmult(long long a, long long b) {
  return (a * b - (long long)((long double)a * b / mod) * mod + mod) % mod;
}
long long Qmult(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    b >>= 1;
    a = a * a % mod;
  }
  return ans;
}
inline long long gcd(long long a, long long b) {
  return b > 0 ? gcd(b, a % b) : a;
}
long long phi(long long n) {
  long long res = n;
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) {
      res -= res / i;
      while (n % i == 0) n /= i;
    }
  if (n > 1) res = res - res / n;
  return res;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    cin >> n;
    int a[1000], b[1000];
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) cin >> b[i];
    int flag = 0;
    for (int i = 1; i < n; i++)
      if (a[i] > a[i + 1]) flag = 1;
    sort(b + 1, b + n + 1);
    if (!flag || b[1] != b[n]) {
      puts("Yes");
    } else {
      puts("No");
    }
  }
  return 0;
}
