/*  prog4a.c -- Solve Least Linear System by Gauss Seidel Method
    Written Feb 20, 2001 by Eric Olson for Mathematics 483

    For more information see Step 13 in First Steps in Numerical
    Analysis, 2nd Edition, by Hosking, Joe, Joyce and Turner. */

#include <stdio.h>
#include <math.h>

#define MAXn 40

static double a[MAXn][MAXn];
static double b[MAXn];
static int n;

int gauss_seidel(double x[MAXn]){
    double y[MAXn];
    double s;
    int iter=0;
    do{
        int i;
        iter++;
        s=0.0;
        for(i=0;i<n;i++) y[i]=x[i];
        for(i=0;i<n;i++){
            int j;
            x[i]=b[i];
            for(j=0;j<i;j++) x[i]-=a[i][j]*x[j];
            for(j=i+1;j<n;j++) x[i]-=a[i][j]*y[j];
            x[i]/=a[i][i];
            s+=fabs(y[i]-x[i]);
        }
        if(s>1.0e+32 || iter>10000) return 0;
    } while(s>1.0e-5);
    return iter;
}

outmatrix(double a[MAXn][MAXn]){
    int i,j;
    printf("[");
    for(i=0;i<n;i++){
        putchar('\n');
        for(j=0;j<n;j++){
            printf("%lg ",a[i][j]);
        }
    }
    puts("]");
}

outvector(double x[MAXn]){
    int j;
    printf("[ ");
    for(j=0;j<n;j++) printf("%lg ",x[j]);
    puts("]");
}

main(){
    double x[MAXn];
    for(;;){
        if(scanf("%d",&n)!=1) exit(0);
        if(n<=0) exit(0);
        if(n>MAXn) {
            puts("Capacity exceeded!");
            exit(1);
        } {
            int i,j;
            for(i=0;i<n;i++){
                for(j=0;j<n;j++){
                    if(scanf("%lg",&a[i][j])!=1){
                        puts("Incomplete matrix data!");
                        exit(2);
                    }
                }
            }
            printf("A = ");
            outmatrix(a);
            putchar('\n');
        } {
            int i,m;
            if(scanf("%d",&m)!=1){
                puts("No vector data!");
                exit(3);
            }
            for(i=0;i<m;i++){
                int j;
                for(j=0;j<n;j++){
                    if(scanf("%lg",&b[j])!=1){
                        puts("Incomplete vector data!");
                        exit(4);
                    }
                }
                printf("b = "); outvector(b);
                for(j=0;j<n;j++) x[j]=b[j];
                {
                    int k=gauss_seidel(x);
                    if(k){
                        printf("x = "); outvector(x);
                        printf("Solution converged in %d iterations.\n\n",k);
                    } else {
                        printf("Failed convergence.\n\n");
                    }
                }
            }
        }
    }
}