#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
long double x[100000], y[100000], a[100000], b[100000];
long double a0, b0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(9);
  int n;
  cin >> n;
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) cin >> x[i];
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) cin >> y[i];
  if (x[0] == 0)
    a[0] = 0, b[0] = y[0];
  else {
    a[0] =
        ((x[0] + y[0]) - sqrtl((x[0] + y[0]) * (x[0] + y[0]) - 4 * x[0])) / 2;
    b[0] = x[0] / a[0];
  }
  a0 += a[0], b0 += b[0];
  long double ze = 0;
  for (int(i) = (1); (i) <= (n - 1); (i) += (1)) {
    long double c = x[i] + y[i];
    long double t1 = (a0 - b0 + c);
    long double t2 = sqrtl(max(ze, t1 * t1 - 4 * x[i] + 4 * b0 * c));
    t1 /= 2, t2 /= 2;
    if (t1 - t2 < 0)
      b[i] = t1 + t2;
    else
      b[i] = t1 - t2;
    a[i] = c - b[i];
    a0 += a[i], b0 += b[i];
  }
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) cout << a[i] << ' ';
  cout << '\n';
  for (int(i) = (0); (i) <= (n - 1); (i) += (1)) cout << b[i] << ' ';
}
