#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

typedef long long int lld;
typedef pair<int,int> PII;

const int INF = (1<<31)-1;
const lld LINF = (1LL<<63)-1;

const int NMAX = 100000+5;
const int MMAX = 100000+5;
const int KMAX = 100000+5;
const int PMAX = 100000+5;
const int LMAX = 100000+5;
const int VMAX = 100000+5;

int N,i,j;
double A[NMAX],B[NMAX],C[NMAX],a[NMAX],b[NMAX],c[NMAX],d[NMAX],X[NMAX];

int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    scanf("%d",&N);

    for(i=1; i<=N; i++)
        cin>>a[i]>>b[i]>>c[i]>>d[i];

    A[1]=b[1];
    B[1]=c[1];
    C[1]=d[1];

    for(i=2; i<=N; i++)
    {
        A[i]=b[i]-B[i-1]*a[i-1]/A[i-1];
        B[i]=c[i];
        C[i]=d[i]-C[i-1]*a[i-1]/A[i-1];
    }

    X[N]=C[N]/A[N];

    for(i=N-1; i>=1; i--)
        X[i]=(C[i]-B[i]*X[i+1])/A[i];

    for(i=1; i<=N; i++)
        printf("%.7lf\n",X[i]);

    return 0;
}