#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  double A,B,C,D,E,F;
  cin>>A>>B>>C>>D>>E>>F;

  double ansx=(E*C-B*F)/(E*A-B*D);
  double ansy=(D*C-A*F)/(D*B-A*E);

  cout<<fixed<<setprecision(10)<<ansx<<" "<<ansy<<endl;

  return 0;
}