#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

int main(){
	ll n; cin >> n;
	vl a(n), b(n);
	ll sa = 0, sb = 0;
	rep(i,n) cin >> a[i], sa += a[i];
	rep(i,n) cin >> b[i], sb += b[i];
	ll s = sa - sb;
	if(n == 2){
		if(s == 0){
			cout << abs(a[0] - b[0]) << endl;
		}else{
			puts("-1");
		}
		return 0;
	}
	if(s < 0 || s % (n-2) != 0){
		puts("-1");
		return 0;
	}
	ll c = s / (n-2);
	ll rest = c;
	rep(i,n){
		if(a[i] - c > b[i]){
			puts("-1");
			return 0;
		}
		if((b[i] + c - a[i]) % 2 != 0){
			puts("-1");
			return 0;
		}
		rest -= (b[i] + c - a[i]) / 2;
	}
	if(rest != 0){
		puts("-1");
	}else{
		cout << c << endl;
	}
}