Deep within the emerald canopy of the Amazon of Algorithms, a tribe of code-keepers guards the sacred Algorithmic Oracle. The jungle hums with the sound of running processes, and ancient vines are tangled like nested loops. A young initiate named Kai stands before the Oracle, seeking the wisdom to pass the next trial of the Bit Bender path. The Oracle's emerald eyes flash as it presents the trial known as "Co-Prime Check — Level 7". The jungle falls silent. Even the birds stop their chirping, as if the forest itself is waiting to see whether Kai will succeed or be lost among the vines forever. Read two positive integers and print Yes if they are co-prime. The tribal elders have inscribed the following rules upon the bark of the Great Tree: 1 <= a,b <= 10^9 To prove his understanding, Kai must first study these examples carved into the stones at his feet: Input: 12 5 Output: Yes The sun is setting, and the jungle grows dark. Predators begin to stir in the undergrowth. Kai needs your guidance to solve this puzzle before nightfall. Craft a solution that is efficient, correct, and resilient. The Algorithmic Oracle does not forgive mistakes. The path to mastering Co-Prime Check — Level 7 is not one that can be walked in a single step. It demands patience, precision, and a deep respect for the boundaries that shape the problem. Many adventurers before you have attempted this trial and failed, their code crashing against the very constraints that the elders inscribed. But you have the tools. You have the training. You have reached the Bit Bender tier, and that alone means the council believes in your potential. Look once more at the examples above. Trace the logic with your finger if you must. Consider the time and memory limits carefully, for they are not suggestions but strict laws of the arena. When you are ready, commit your solution. Let the compiler run. Let the test cases judge your work. If your code is true, the gates will open and you will move closer to the ultimate rank. If not, study the failure, sharpen your algorithm, and try again. For in the halls of CodeTikki, the only thing more important than success is the wisdom gained from the attempt. Remember that the Bit Bender challenge is designed to test not just knowledge, but character. Every edge case is a lesson. Every time limit is a teacher. Every hidden test is a guardian at the gate. Do not rush. Let your code breathe. Let it be as clean as a mountain stream. When the final test passes, you will know that you have earned the title. Until then, code with courage, test with care, and never stop learning.
Constraints:
1 <= a,b <= 10^9
