#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

void no() {
    cout << -1 << endl;
    exit(0);
}
signed main() {
    int n; cin >> n;
    vector<int> a(n); REP (i, n) cin >> a[i];
    vector<int> b(n); REP (i, n) cin >> b[i];
    vector<bool> in(n);
    queue<int> q;
    int cnt = 0;
    auto is_top = [&](int i) {
        int x = b[(i - 1 + n) % n];
        int y = b[i];
        int z = b[(i + 1) % n];
        return y > x + z;
    };
    REP (i, n) {
        if (is_top(i)) q.push(i), in[i] = true;
    }
    while (!q.empty()) {
        int i = q.front(); q.pop();
        in[i] = false;
        if (b[i] == a[i]) continue;
        if (b[i] < a[i]) no();
        int sum = b[(i - 1 + n) % n] + b[(i + 1) % n];
        if (b[i] % sum < a[i]) {
            int dif = b[i] - a[i];
            if (dif % sum) no();
            cnt += dif / sum;
            b[i] = a[i];
        } else {
            if (b[i] < sum) no();
            cnt += b[i] / sum;
            b[i] %= sum;
            if (!in[(i - 1 + n) % n] && is_top((i - 1 + n) % n)) q.push((i - 1 + n) % n);
            if (!in[(i + 1) % n] && is_top((i + 1) % n)) q.push((i + 1) % n);
        }
    }
    REP (i, n) {
        if (a[i] != b[i]) no();
    }
    cout << cnt << endl;
}


Measured memory_bytes: 4224