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;
long long N = 200000;
vector<bool> visited(N + 1, false);
void findfact(long long x, map<long long, vector<long long>>& m) {
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      if (i == x / i)
        m[x].push_back(i);
      else {
        m[x].push_back(i);
        m[x].push_back(x / i);
      }
      break;
    }
  }
  return;
}
struct cmp {
  bool operator()(const pair<int, int>& a, const pair<int, int>& b) {
    int len1 = a.second - a.first + 1;
    int len2 = b.second - b.first + 1;
    if (len1 == len2) return a.first < b.first;
    return len1 > len2;
  }
};
bool isPalindrome(string t) {
  long long st = 0;
  long long end = t.size() - 1;
  while (st <= end) {
    if (t[st] != t[end]) return false;
    st++;
    end--;
  }
  return true;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool pow2(long long x) {
  if (x == 0) return true;
  if (!x & (x - 1)) return true;
  return false;
}
unsigned long long factorial(unsigned long long n) {
  return (n == 1 || n == 0) ? 1 : n * factorial(n - 1);
}
unsigned long long binomialCoeff(unsigned long long n, unsigned long long k) {
  unsigned long long res = 1;
  if (k > n - k) k = n - k;
  for (unsigned long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long minFlipsMonoIncr(string S) {
  int flip = 0;
  int ones = 0;
  bool flag = false;
  for (int i = 0; i < S.size(); i++) {
    if (S[i] - '0' == 1) flag = true;
    if (flag && S[i] - '0' == 0)
      flip++;
    else if (S[i] == '1')
      ones++;
    if (flip > ones) flip = ones;
  }
  return flip;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long T;
  cin >> T;
  while (T--) {
    long long n;
    cin >> n;
    vector<long long> a(n);
    vector<long long> b(n);
    map<long long, long long> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
      cin >> b[i];
      m[b[i]]++;
    }
    vector<long long> temp(a);
    sort(temp.begin(), temp.end());
    if (a == temp) {
      cout << "Yes"
           << "\n";
      continue;
    }
    if (m.size() == 1)
      cout << "No"
           << "\n";
    else
      cout << "Yes"
           << "\n";
  }
}