#include <cmath>
#include <iostream>

void method_vr() {
  double w = 1.2; // 0<w<2
  int N_max = 10000;
  int S = 0;
  double eps = 0.0001;
  double eps_max = 0;
  double eps_cur = 0;
  int n;
  std::cout << "input n" << '\n';
  std::cin >> n;
  double a[n][n];
  double x[n + 2];
  x[0] = 0;
  x[n + 1] = 0;
  double b[n];
  std::cout << "input a[n][n]" << '\n';
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      std::cin >> a[i][j];
    }
  }
  std::cout << "input b[n]" << '\n';
  for (int j = 0; j < n; ++j) {
    std::cin >> b[j];
  }
  std::cout << "input x[n]" << '\n';
  for (int j = 1; j < n + 1; ++j) {
    std::cin >> x[j];
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      std::cout << a[i][j] << ' ';
    }
    std::cout << b[i] << '\n';
  }

  double x_old;
  double x_new;
  bool f = false;
  while (!f) {
    for (int i = 1; i < n + 1; ++i) {
      x_old = x[i];
      x_new = (1 - w) * a[i - 1][i - 1] * x[i] + w * b[i - 1];
      for (int j = 1; j < n + 1; ++j) {
        if (j != i) {
          x_new -= w * a[i - 1][j - 1] * x[j];
        }
      }
      x_new /= a[i - 1][i - 1];
      eps_cur = fabs(x_old - x_new);
      if (i == 1) {
        eps_max = eps_cur;
      } else if (eps_cur > eps_max) {
        eps_max = eps_cur;
      }
      x[i] = x_new;
    }
    S += 1;
    if ((eps_max <= eps) || (S >= N_max)) {
      f = true;
      std::cout << "eps_max: " << eps_max << '\n';
    }
  }
  for (int i = 1; i < n + 1; ++i) {
    std::cout << S << ':' << x[i] << ' ';
  }
  std::cout << '\n';
  std::cout << "count of steps: " << S << '\n';
}

int main() {
  method_vr();
  return 0;
}