#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const double eps = 1e-15;
int n;
double p[N + 9], q[N + 9];
void into() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lf", &p[i]);
  for (int i = 1; i <= n; ++i) scanf("%lf", &q[i]);
}
double a[N + 9], b[N + 9];
double Get_root(double a, double b, double c) {
  return fabs(a) <= eps ? -c / b
                        : (sqrt(max(b * b - 4 * a * c, 0.0)) - b) / (2 * a);
}
void Get_ans() {
  for (int i = 1; i <= n; ++i) {
    double x = p[i] + a[i - 1] * b[i - 1];
    double y = p[i] + q[i] + a[i - 1] + b[i - 1];
    b[i] = Get_root(1, -y, x);
    a[i] = y - b[i];
  }
  for (int i = n; i >= 1; --i) a[i] -= a[i - 1], b[i] -= b[i - 1];
}
void work() { Get_ans(); }
void outo() {
  for (int i = 1; i <= n; ++i) printf("%.10lf ", a[i]);
  puts("");
  for (int i = 1; i <= n; ++i) printf("%.10lf ", b[i]);
  puts("");
}
int main() {
  int T = 1;
  for (; T--;) {
    into();
    work();
    outo();
  }
  return 0;
}
