#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int a, b, c, d, e, f;
  int x, y;
  double xx, yy;
  while(cin>>a>>b>>c>>d>>e>>f){
    x = round(10000*(b*f-c*e)/(b*d-a*e));
    y = round(10000*(c*d-a*f)/(b*d-a*e));
    xx = x;
    yy = y;
    cout<<fixed<<setprecision(3)<<xx/10000<<" "<<yy/10000<<endl;
  }
}

