#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <utility>

using namespace std;

#define MAXN 100100

int N;
double A[MAXN], B[MAXN], C[MAXN], D[MAXN], X[MAXN];

int main() {
//	freopen("date.in", "r", stdin);
//	freopen("date.out","w", stdout);
	
	scanf("%d", &N);
	for(int i = 0; i < N; i++)
        scanf("%lf %lf %lf %lf", &A[i], &B[i], &C[i], &D[i]);
	
	C[0] /= B[0];
	for(int i = 1; i < N - 1; i++)
        C[i] /= B[i] - A[i - 1] * C[i - 1];
    D[0] /= B[0];
	for(int i = 1; i < N; i++)
        D[i] = (D[i] - A[i - 1] * D[i - 1]) / (B[i] - A[i - 1] * C[i - 1]);
	
	X[N - 1] = D[N - 1];
	for(int i = N - 2; i >= 0; i--)
        X[i] = D[i] - X[i + 1] * C[i];
    
    for(int i = 0; i < N; i++)
        printf("%.10lf\n", X[i]);
	
	return 0;
}