GGD - Mr Toothless and His GCD Operation
题意翻译
给出一个数 $N\ (2\le N\le 10^6)$，要求构造 $a,b(1\le a<b\le N)$，使得 $\gcd(a,b)$ 最大。如果有多种方案，输出能使 $a+b$ 最大的那一种。
共有 $T$ 组数据（$1\le T\le 100$）。第 $i$ 组的输出格式为`Case i: a b`（$i$ 为组数的编号，$a,b$ 为答案）。
题目描述
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<=a<b<=N**.
**Input**
Input starts with an integer **T (, denoting the number of test cases.**
Each case contains an integer **N (2 .**
**Output**
For each case, print the case number and then print **a** and **b**. If there exists multiple solutions print the one where **a+b** is maximum.
**Sample Input/Output**
**Sample Input**
**Sample Output**
1
2
Case 1: 1 2
**_Problem Setter: Md Abdul Alim, Department of CSE, Bangladesh University of Business & Technology_**