If you have solved the previous problem, the problem setter is congratulating you. Now focus on your next problem.
In this problem you will be given an integer N i.e (N=XY). Your task is to find the X - Y so that X - Y is minimized.
First line of input contains an integer T denoting the number of testcase. Next T lines contain one integer N which is described above.
Print case no and X-Y separating by a single space. For more clearification see sample testcase.
3 2 4 6
Case #1: 1 Case #2: 0 Case #3: 1
Problem Setter: Md. Masud Mazumder