Monocarp is playing a computer game. Now he wants to complete the first level of this game.

A level is a rectangular grid of 2 rows and n columns. Monocarp controls a character, which starts in cell (1, 1) — at the intersection of the 1-st row and the 1-st column.

Monocarp's character can move from one cell to another in one step if the cells are adjacent by side and/or corner. Formally, it is possible to move from cell (x_1, y_1) to cell (x_2, y_2) in one step if |x_1 - x_2| ≤ 1 and |y_1 - y_2| ≤ 1. Obviously, it is prohibited to go outside the grid.

There are traps in some cells. If Monocarp's character finds himself in such a cell, he dies, and the game ends.

To complete a level, Monocarp's character should reach cell (2, n) — at the intersection of row 2 and column n.

Help Monocarp determine if it is possible to complete the level.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Then the test cases follow. Each test case consists of three lines.

The first line contains a single integer n (3 ≤ n ≤ 100) — the number of columns.

The next two lines describe the level. The i-th of these lines describes the i-th line of the level — the line consists of the characters '0' and '1'. The character '0' corresponds to a safe cell, the character '1' corresponds to a trap cell.

Additional constraint on the input: cells (1, 1) and (2, n) are safe.

Output

For each test case, output YES if it is possible to complete the level, and NO otherwise.

Example

Input


4
3
000
000
4
0011
1100
4
0111
1110
6
010101
101010


Output


YES
YES
NO
YES

Note

Consider the example from the statement.

In the first test case, one of the possible paths is (1, 1) → (2, 2) → (2, 3).

In the second test case, one of the possible paths is (1, 1) → (1, 2) → (2, 3) → (2, 4).

In the fourth test case, one of the possible paths is (1, 1) → (2, 2) → (1, 3) → (2, 4) → (1, 5) → (2, 6).
1
9
000000010
000000000
 1
9
000000010
000100000
 1
60
000000000000000000000000000000000000000000000000000000000010
000000000000000000000000000000000000000000000000000000000010

YES
 YES
 NO

#include <bits/stdc++.h>
using namespace std;
const int n1 = 1e9 + 7;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(double t) { cerr << t; }
struct compare {
  inline bool operator()(const std::string& first,
                         const std::string& second) const {
    return first.size() < second.size();
  }
};
long long fact(long long n) {
  long long ans = 1;
  for (long long i = 1; i < n + 1; i++) {
    ans = ((ans % n1) * (i % n1)) % n1;
  }
  return ans;
}
long long power(long long N, long long M) {
  long long power = N, sum = 1;
  if (M == 0) return 1ll;
  while (M > 0) {
    if ((M & 1ll) == 1ll) {
      sum = ((sum % n1) * (power % n1));
      ;
    }
    power = ((power % n1) * (power % n1)) % n1;
    M = M >> 1;
  }
  return sum;
}
int check_comp(int n) {
  int first = 0;
  for (int i = 2; i < (int)(sqrt(n) + 1); i++) {
    if (n % i == 0) {
      first = 1;
      break;
    }
  }
  return first;
}
int is_hill(int a[], int i, int n) {
  if (a[i] > a[i + 1] && a[i] > a[i - 1] && i > 0 && i < n - 1)
    return 1;
  else
    return 0;
}
int is_valley(int a[], int i, int n) {
  if (a[i] < a[i - 1] && a[i] < a[i + 1] && i > 0 && i < n - 1)
    return 1;
  else
    return 0;
}
int cnt[150002] = {0};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    string str[2];
    for (int i = 0; i < 2; i++) {
      cin >> str[i];
    }
    int f1 = 1;
    for (int i = 0; i < n - 1; i++) {
      if (str[0][i + 1] == '1' && str[1][i] == '1' && str[1][i + 1] == '1') {
        f1 = 0;
        break;
      }
    }
    if (f1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
