Chinese Remainder Theorem 2

Problem Description

There are $T$ test cases. Each case gives $n$ equations of the form $x \equiv a_i \pmod{m_i}$. Determine whether the system of equations has a solution.

Input Format

The first line contains one integer $T$.

For each test case, the first line contains one integer $n$, and the next $n$ lines each contain two integers $a_i, m_i$.

Output Format

For each test case, output one string Yes or No indicating whether a solution exists.

Sample Input

2
3
1 10
2 11
3 12
3
2 10
2 11
3 12

Sample Output

Yes
No

Constraints

It is guaranteed that $T \le 1000$, $1 \le n \le 50$, and $0 \le a_i < m_i \le 10^5$.