#include <stdio.h>

const int N = 3;

int main() {
    double matrix[N][N + 1];
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N + 1; ++j) {
            scanf("%lf", &(matrix[i][j]));
        }
    }
    for (int k = 0; k < N; ++k) {
        for (int i = 0; i < N; ++i) {
            if (matrix[i][k] != 0){
                int check = 1;
                for (int j = 0; j < k; ++j) {
                    if (matrix[i][j] != 0){
                        check = 0;
                        break;
                    }
                }
                if (check){
                    double elem = matrix[i][k];
                    for (int j = 0; j < N + 1; ++j) {
                        matrix[i][j] /= elem;
                    }
                    /*for (int m = 0; m < N; ++m) {
                        for (int j = 0; j < N + 1; ++j) {
                            printf("%lf ", matrix[m][j]);
                        }
                        printf("\n");
                    }
                    printf("\n");*/
                    for (int l = 0; l < N; ++l) {
                        if (l == i){
                            continue;
                        }
                        double coef = matrix[l][k];
                        for (int j = 0; j < N + 1; ++j) {
                            matrix[l][j] -= matrix[i][j] * coef;
                        }
                    }
                    /*for (int m = 0; m < N; ++m) {
                        for (int j = 0; j < N + 1; ++j) {
                            printf("%lf ", matrix[m][j]);
                        }
                        printf("\n");
                    }
                    printf("\n");*/
                }
            }
        }
    }
    for (int m = 0; m < N; ++m) {
        for (int i = 0; i < N + 1; ++i) {
            printf("%lf ", matrix[m][i]);
        }
        printf("\n");
    }
    for (int n = 0; n < N; ++n) {
        printf("x%d = %lf\n", n + 1, matrix[n][N]);
    }
    return 0;
}