Fibonacci Prime Numbers#7811
In life, not everything is straightforward, especially when it comes to numbers.
You are provided with a set of numbers. For each number, your task is to determine if the Fibonacci number at that index is a prime number.
The first line of the input contains a single integer, 1 \leq T \leq 5000, representing the number of indices for Fibonacci sequence numbers. Following this, there are natural numbers, each not exceeding 10^{18}.
For each index, output YES on a new line if the Fibonacci number at that index is prime, and NO otherwise.
Example 1