#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define n 1000

main(){
  FILE *fpa,*fpb;
  int i,j,k,c;
  double array[n][n+1],dum,pivot,aik,akj,max;

  /* input */

  fpa=fopen("a.dat","r");
  fpb=fopen("b.dat","r");

  for(j=0;j<n;j++){
    for(i=0;i<n;i++){
      fscanf(fpa,"%lf",&array[i][j]);
    }
  }

  fclose(fpa);

  for(i=0;i<n;i++){
      fscanf(fpb,"%lf",&array[i][n]);
    }
 
  fclose(fpb);


/* check :pivot */
  for(k=0;k<n;k++){
    max=0;
    c=k;
    for(j=k;j<n;j++){
      if(fabs(array[j][k])>max){
max=fabs(array[j][k]);
c=j;
      }
    }
    if(max==0){
      printf("no-solution\n");
      exit(1);
    }
    for(j=0;j<=n;j++){
      dum=array[k][j];
      array[k][j]=array[c][j];
      array[c][j]=dum;
    }
/* gauss  */
    pivot=array[k][k];
    if(pivot==0){
      printf("no-solution\n");
      exit(1);
    }
    
    for(j=k;j<=n;j++){
      array[k][j]/=pivot;
    }
    for(i=k+1;i<n;i++){
      aik=array[i][k];
      for(j=k;j<=n;j++){
array[i][j]-=array[k][j]*aik;
      }
    }
  }
  for(k=n-2;k>=0;k--){
    for(j=n-1;j>k;j--){
      akj=array[k][j];
      array[k][n]-=akj*array[j][n];
      array[k][j]-=akj*array[j][j];
    }
  }
  
/* output */
  printf("(");

  for(i=0;i<n-1;i++){

    printf("%lf,",array[i][n]);

  }

  printf("%lf)\n",array[n-1][n]);

}