#include <bits/stdc++.h> using namespace std; #define ll long long #define MoD 1e9 + 7 #define clear(a) memset(a, 0, sizeof(a)) #define fo(i, a, b) for(int i = a; i < b; i++) //#define re(i, a, b) for(int i = b; i > a; i--) #define pb(a) push_back(a) template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} int a, b, c, d, e, f; int gcm(int a1, int b1){ int n_mx=max(a1,b1); int n_mi=min(a1,b1); int m= n_mx % n_mi; if(m!=0) return gcm(m, n_mi); else return n_mi; } int lcm(int a1,int b1){ return (a1*b1/gcm(a1,b1)); } void solve(){ cin >> a >> b >> c >> d >> e >> f; double xf= lcm(a,d), yf= lcm(b,e); cout.precision(20); cout << ((yf*c/b)-(yf*f/e))/((yf*1.0*a/b)-(yf*1.0*d/e)) << ' ' << ((xf*c/a)-(xf*f/d))/((xf*1.0*b/a)-(xf*1.0*e/d)) << '\n'; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t=1; for(int i=1; i<=t; ++i) { solve(); } }