**Compilation/Execution Result:**

A number n is said to be a Carmichael number if it satisfies the following modular arithmetic condition:

```
power(b, n-1) MOD n = 1,
for all b ranging from 1 to n such that b and
n are relatively prime, i.e, gcd(b, n) = 1
```

Given a positive integer n, find if it is a Carmichael number.

**Input:**

First line of input contains the number of test cases.

Only line of each test case contains the number n.

**Output:**

Print "Yes" if the number is a Carmichael number else "No" without quotes.

**Constraints:**

1<=T<=100

1<=N<=100000

**Example:**

**Sample Input:**

1

8

**Sample Output:**

No

**Explanation :**

8 is not a Carmichael number because 3 is relatively prime to 8 and

(3^{8-1}) % 8 = 2187 % 8 is not 1.

rksingh | 28 |

Sahil Dudeja | 24 |

dgr8swati | 24 |

Shashank_Pathak | 24 |

Lam Ngoc Pham | 20 |

Shashank_Pathak | 608 |

surbhi_7 | 556 |

dark_knights | 554 |

Infinty | 341 |

Vasudha Gupta | 340 |

akhayrutdinov | 4156 |

sanjay05 | 3611 |

Quandray | 2799 |

Ibrahim Nash | 2475 |

Michael Riegger | 2288 |