#include<bits/stdc++.h>
using namespace std;

int h = 2, w = 2;
vector<vector<long long>> gcd(vector<vector<long long>> a){
	if(a[0][1] == 0 || a[0][0] == 0) return a;
	if(abs(a[0][0]) > abs(a[0][1])){
		swap(a[0][0], a[0][1]);
		swap(a[1][0], a[1][1]);
	}
	if(a[0][0] < 0){
		a[0][0] *= -1;
		a[0][1] *= -1;
	}
	long long k = a[0][1]/a[0][0];
	a[0][1] -= k*a[0][0];
	if(a[0][1] < 0){
		k--;
		a[0][1] += a[0][0];
	}
	a[1][1] -= k*a[1][0];
	return gcd(a);
}

vector<vector<long long>> rotate(vector<vector<long long>> a){
	auto b = a;
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			b[i][j] = a[j][w-i-1];
		}
	}
	return b;
}
int main(){
	vector<vector<long long>> a(h, vector<long long>(w));
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			cin >> a[i][j];
		}
	}
	for(int i=0; i<4; i++){
		a = gcd(a);
		a = rotate(a);
	}
	for(int i=0; i<4; i++){
		if(a[0][0] == 0) continue;
		if(a[0][1]%a[0][0] == 0) a[0][1] = 0;
		if(a[1][0]%a[0][0] == 0) a[1][0] = 0;
	}
	long long mi = -1;
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			if(a[i][j] != 0){
				if(mi == -1) mi = abs(a[i][j]);
				if(abs(a[i][j]) < mi) mi = abs(a[i][j]);
 			}
		}
	}
	if(mi == -1){
		cout << "0 0" << endl;
		return 0;
	}
	while(abs(a[0][0]) != mi) a = rotate(a);
	{
		long long k = a[0][1]/a[0][0];
		a[1][1] -= a[1][0]*k;
		a[0][1] = a[1][0] = 0;
	}
	long long ans1 = abs(a[0][0]);
	long long ans2 = abs(a[0][0]);
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			if(a[i][j] != 0){
				ans1 = __gcd(ans1, abs(a[i][j]));
				ans2 /= __gcd(ans2, abs(a[i][j]));
				ans2 *= abs(a[i][j]);
			}
		}
	}
	cout << ans1 << " " << ans2 << endl;
}