Problem: Apples and Oranges. You thought this question was gone when you passed class 6th. WELL YOU ARE WRONG. It's back.

See we have n apples and m oranges. You need to put these apples and oranges into some boxes. Though we've put some terms&conditions with a bright *

1. Number of apples should be same in each box.

2. Number of oranges should be same in each box

3. Number of boxes should be greatest under the above two conditions

Input

First line contains n & m, two integers. n lies in 1 to 10^9. m lies in 1 to 10^9
Output
Number of apples and oranges in each box

Sample Input

12028 12772

Sample Output
97 103

 Explanation 
Seriously? Just look at the numbers. Try Harder. Again look at the numbers.

SAMPLE INPUT
12028 12772

SAMPLE OUTPUT
97 103

Solution (in PYTHON):

Solution:
import sys
f=sys.stdin

def gcd(a,b):
	
	while b:
		temp=a
		a=b
		b=temp%b
	return a

n,m=[int(x) for x in f.readline().split()]

hcf=gcd(n,m)

a=n/hcf
b=m/hcf

sys.stdout.write(str(a)+' '+str(b)+'\n')