using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            AGC037.C();
        }



        class AGC037
        {
            public static void A()
            {
                var S = Read.Str();
                var N = S.Length;
                var dp = new int[N + 1, 4];
                dp[0, 2] = dp[0, 3] = -1000000000;
                for(int i = 0; i < N; ++i)
                {
                    dp[i + 1, 0] = dp[i, 1] + 1; if (i > 0 && S[i] != S[i - 1]) { dp[i + 1, 0] = Math.Max(dp[i + 1, 0], dp[i, 0] + 1); }
                    dp[i + 1, 1] = dp[i, 2] + 1; if (i > 3 && (S[i] != S[i - 2] || S[i - 1] != S[i - 3])) { dp[i + 1, 1] = Math.Max(dp[i + 1, 1], dp[i, 3] + 1); }
                    dp[i + 1, 2] = dp[i, 0];
                    dp[i + 1, 3] = dp[i, 1];
                }
                Console.WriteLine(Math.Max(dp[N, 0], dp[N, 1]));
            }
            public static void C()
            {
                var N = Read.Int();
                var A = Read.IntN();
                var B = Read.IntN();
                Util.PriorityQueue<Tuple<int, int>> queue = new Util.PriorityQueue<Tuple<int, int>>(N, Comparer<Tuple<int, int>>.Create((t1, t2) => -t1.Item1.CompareTo(t2.Item1)));
                for(int i = 0; i < N; ++i)
                {
                    if (A[i] != B[i]) { queue.Push(new Tuple<int, int>(B[i], i)); }
                }
                long count = 0;
                while (queue.Count() > 0)
                {
                    var tuple = queue.Pop();
                    var i = tuple.Item2;
                    var b = B[i];
                    var a = B[(i + N - 1) % N];
                    var c = B[(i + 1) % N];
                    if ((b - A[i]) % (a + c) == 0)
                    {
                        count += (b - A[i]) / (a + c);
                        B[i] = A[i];
                    }
                    else
                    {
                        var v = (b - A[i] - 1) / (a + c);
                        count += v;
                        B[i] -= v * (a + c);
                        if (v == 0 || A[i] > B[i]) { Console.WriteLine(-1); return; }
                        queue.Push(new Tuple<int, int>(B[i], i));
                    }
                }
                Console.WriteLine(count);
            }
        }
        class Util
        {
            public class PriorityQueue<T> where T : IComparable
            {
                private IComparer<T> _comparer = null; private bool _isAsc = true; private T[] _heap; private int _sz = 0;
                public PriorityQueue(int maxSize, IComparer<T> comparer) { _heap = new T[maxSize]; _comparer = comparer; }
                public PriorityQueue(int maxSize, bool isAsc = true) { _heap = new T[maxSize]; _isAsc = isAsc; }
                private int Compare(T x, T y) { if (_comparer != null) { return _comparer.Compare(x, y); } return _isAsc ? x.CompareTo(y) : y.CompareTo(x); }
                public void Push(T x) { var i = _sz++; while (i > 0) { var p = (i - 1) / 2; if (Compare(_heap[p], x) <= 0) { break; } _heap[i] = _heap[p]; i = p; } _heap[i] = x; }
                public T Pop() { T ret = _heap[0]; T x = _heap[--_sz]; int i = 0; while (i * 2 + 1 < _sz) { int a = i * 2 + 1; int b = i * 2 + 2; if (b < _sz && Compare(_heap[b], _heap[a]) < 0) { a = b; } if (Compare(_heap[a], x) >= 0) { break; } _heap[i] = _heap[a]; i = a; } _heap[i] = x; return ret; }
                public int Count() { return _sz; }
                public T Peek() { return _heap[0]; }
                public bool Contains(T x) { for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true; return false; }
            }
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new HashSet<int>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1]);
                    dict[ab[1]].Add(ab[0]);
                }
                return dict;
            }
            public static Dictionary<int, Dictionary<int, long>> AdjacencyListWithWeight(int N, int M)
            {
                Dictionary<int, Dictionary<int, long>> dict = new Dictionary<int, Dictionary<int, long>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new Dictionary<int, long>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1], ab[2]);
                    dict[ab[1]].Add(ab[0], ab[2]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 53068