#include<unordered_set>
#include<unordered_map>
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cstdlib>
#include<algorithm>
#include<list>
#include<string>
#include<cmath>
#include<bitset>
#include<stack>
#define forx(a,b,c) for(int (a)=(b);(a)<(c);(a)++)
#define ford(a,b,c) for(int (a)=(b)-1;(a)>=(c);(a)--)
using namespace std;
typedef long long ll;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-'){
			f=-1;
		}
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=x*10+ch-48;
		ch=getchar();
	}
	return x*f;
}
inline void write(int n){
	if(n<0){
		putchar('-');
		n*=-1;
	}
	if(n>9){
		write(n/10);
	}
	putchar(n%10+'0');
}
int main(){
	int a,b,x,y,s;
	char m,n;
	a=read(),m=read();
	b=read(),x=read();
	n=read(),y=read();
	x*=a,y*=b;
	s=__gcd(x,y);
	x/=s,y/=s;
	write(y);
	cout<<" ";
	write(x);
	puts("");
	return 0;
}