t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.sort()
b.sort()
ans = "YES"
for i in range(n):
if a[i] != b[i] and a[i] + 1 != b[i]:
ans = "NO"
break
print(ans)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i, t;
cin >> t;
for (i = 0; i < t; i++)
{
int a, b, j, n, flag = 0;
cin >> n;
vector<int> A(n);
vector<int> B(n);
for (j = 0; j < n; j++)
{
cin >> a;
A[j] = a;
}
sort(A.begin(), A.end());
for (j = 0; j < n; j++)
{
cin >> b;
B[j] = b;
}
sort(B.begin(), B.end());
for (j = 0; j < n; j++)
{
if ((B[j] - A[j] != 0) && (B[j] - A[j] != 1))
{
flag = 1;
break;
}
}
if (flag == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
return 0;
}
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |