#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
typedef long double ld;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
template<class T> inline bool chmax(T &a,T& b){if(a < b){a = b; return true;} else return false;};
template<class T> inline bool chmin(T &a,T& b){if(a > b){a = b; return true;} else return false;};
int main(){
    ld a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    ld x, y;
    x = (b*f - e*c) / (b*d - a*e);
    y = (c - a*x) / b;
    cout << fixed << setprecision(6) << x << ' ' << y << endl;
}
/*

ax + by = c
y = (c - ax) / b
dx + ey = f
dx + e(c - ax)/b = f
dx - aex/b = f - ec/b
(d - ae/b)x = f - ec/b

*/