#include <iostream>
#include <cmath>
#include <vector>

using namespace std;

int main()
{
    long long int n = 0;
    cin >> n;

    long long int step = (n - 2) > 0 ? n - 2 : 1;
    vector<long long int> in(n);
    vector<long long int> to(n);
    vector<long long int> temp(n);
    long long int Sum = 0;
    long long int Steps = 0;

    for (auto& item : in) {
        cin >> item;
    }
    for (auto& item : to) {
        cin >> item;
    }

    for (int i = 0; i < n; ++i) {
        Sum += (to[i] - in[i]);
        temp[i] = in[i] - to[i];
    }

    if (to == in) {
        for (int i = 0; i < n; ++i) {
            cout << 0 << " ";
        }
    }
    else if (n == 1 && in[0] >= to[0]) {
        cout << in[0] - to[0];
    }
    else if ((n == 2 && Sum == 0) || (Sum > 0 && Sum % step == 0)) {
        Sum == 0 ? Steps = abs(to[0] - in[0]) : Steps = Sum / step;
        for (int i = 0; i < n; ++i) {
            cout << (temp[i] + Steps) / 2 << " ";
        }
    }
    else {
        cout << "-1";
    }


    return 0;
}