SP19786 GGD - Mr Toothless and His GCD Operation
Description
You are given **N**. You have to find two numbers **a** and **b** such that **GCD (a, b)** is as maximum as possible where **1
Input Format
N/A
Output Format
N/A