#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const double eps = 1e-15;
double ma[N], mi[N], a[N], b[N], sumb[N], suma[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &ma[i]);
  for (int i = 1; i <= n; i++) scanf("%lf", &mi[i]);
  for (int i = 1; i <= n; i++) {
    double x1 = ma[i] + mi[i], x2 = ma[i] - mi[i];
    double x3 = 2.0 * sumb[i - 1] - 1, x4 = 2.0 * suma[i - 1] - 1;
    double y1 = 2.0, y2 = x3 - x4 - 2.0 * x1, y3 = x2 - x1 * x3;
    y2 /= y1;
    y3 /= y1;
    double b1, b2;
    if (y2 * y2 - 4.0 * y3 < 0)
      b1 = -y2 / 2.0, b2 = -y2 / 2.0;
    else
      b1 = (-y2 + sqrt(y2 * y2 - 4.0 * y3)) / 2.0,
      b2 = (-y2 - sqrt(y2 * y2 - 4.0 * y3)) / 2.0;
    double a1 = x1 - b1, a2 = x1 - b2;
    if (abs(a1 - b1) < abs(a2 - b2))
      a[i] = a1, b[i] = b1;
    else
      a[i] = a2, b[i] = b2;
    a[i] = max(a[i], 0.0);
    b[i] = max(b[i], 0.0);
    a[i] = min(a[i], 1.0 - suma[i - 1]);
    b[i] = min(b[i], 1.0 - sumb[i - 1]);
    suma[i] = suma[i - 1] + a[i];
    sumb[i] = sumb[i - 1] + b[i];
  }
  for (int i = 1; i <= n; i++) printf("%.8lf ", a[i]);
  printf("\n");
  for (int i = 1; i <= n; i++) printf("%.8lf ", b[i]);
  return 0;
}
