#include using namespace std; using LL = long long int; #define incII(i, l, r) for(LL i = (l) ; i <= (r); i++) #define incIX(i, l, r) for(LL i = (l) ; i < (r); i++) #define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++) #define incXX(i, l, r) for(LL i = (l) + 1; i < (r); i++) #define decII(i, l, r) for(LL i = (r) ; i >= (l); i--) #define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--) #define decXI(i, l, r) for(LL i = (r) ; i > (l); i--) #define decXX(i, l, r) for(LL i = (r) - 1; i > (l); i--) #define inc(i, n) incIX(i, 0, n) #define dec(i, n) decIX(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec1(i, n) decII(i, 1, n) auto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); }; auto inIX = [](auto x, auto l, auto r) { return (l <= x && x < r); }; auto inXI = [](auto x, auto l, auto r) { return (l < x && x <= r); }; auto inXX = [](auto x, auto l, auto r) { return (l < x && x < r); }; auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); }; auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); }; auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); }; auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); }; #define PB push_back #define EB emplace_back #define MP make_pair #define MT make_tuple #define FI first #define SE second #define FR front() #define BA back() #define ALL(c) c.begin(), c.end() #define RALL(c) c.rbegin(), c.rend() #define RV(c) reverse(ALL(c)) #define SC static_cast #define SI(c) SC(c.size()) #define SL(c) SC(c.size()) #define RF(e, c) for(auto & e: c) #define SF(c, ...) for(auto & [__VA_ARGS__]: c) #define until(e) while(! (e)) #define if_not(e) if(! (e)) #define ef else if #define UR assert(false) auto * IS = & cin; auto * OS = & cout; array SEQ = { "", " ", "" }; // input template T in() { T a; (* IS) >> a; return a; } // input: tuple template void tin_(istream & is, U & t) { if constexpr(I < tuple_size::value) { is >> get(t); tin_(is, t); } } template istream & operator>>(istream & is, tuple & t) { tin_<0>(is, t); return is; } template auto tin() { return in>(); } // input: array template istream & operator>>(istream & is, array & a) { RF(e, a) { is >> e; } return is; } template auto ain() { return in>(); } // input: multi-dimensional vector template T vin() { T v; (* IS) >> v; return v; } template auto vin(N n, M ... m) { vector(m ...))> v(n); inc(i, n) { v[i] = vin(m ...); } return v; } // input: multi-column (tuple) template void colin_([[maybe_unused]] U & t) { } template void colin_(U & t) { get(t).PB(in()); colin_(t); } template auto colin(int n) { tuple ...> t; inc(i, n) { colin_ ...>, 0, T ...>(t); } return t; } // output void out_([[maybe_unused]] string s) { } template void out_([[maybe_unused]] string s, A && a) { (* OS) << a; } template void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); } auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; }; auto out = [](auto ... a) { outF("", " " , "\n", a ...); }; auto outS = [](auto ... a) { outF("", " " , " " , a ...); }; auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); }; auto outN = [](auto ... a) { outF("", "" , "" , a ...); }; // output: multi-dimensional vector template ostream & operator<<(ostream & os, vector const & v) { os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]); } template void vout_(T && v) { (* OS) << v; } template void vout_(T && v, A a, B ... b) { inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); } } template void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; } template void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << flush; } // ---- ---- template class SegmentTree { private: int n, s; vector a; function f; T e; bool ok; void shift(int & p) { assert(inIX(p, 0, n)); p += s; } public: SegmentTree() { n = 0; } SegmentTree(int nn, function ff, T ee) { init(nn, ff, ee); } void init(int nn, function ff, T ee) { n = nn; f = ff; e = ee; s = 1; while(s < n) { s *= 2; } a = vector(2 * s, e); ok = true; } void apply(int p, function g) { shift(p); g(a[p]); while(p > 1) { p /= 2; a[p] = f(a[2 * p], a[2 * p + 1]); } } T fold_IX(int l, int r) { assert(ok); assert(inII(l, 0, n)); l += s; assert(inII(r, 0, n)); r += s; r--; T x = e, y = e; while(l <= r) { if(l % 2 == 1) { x = f(x, a[l]); l++; } if(r % 2 == 0) { y = f(a[r], y); r--; } l /= 2; r /= 2; } return f(x, y); } T fold_II(int l, int r) { return fold_IX(l + 0, r + 1); } T fold_XI(int l, int r) { return fold_IX(l + 1, r + 1); } T fold_XX(int l, int r) { return fold_IX(l + 1, r + 0); } const T & operator[](int p) { shift(p); return a[p]; } T & ref(int p) { shift(p); ok = false; return a[p]; } void calc() { dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); } ok = true; } }; #define OP(s) [&](auto & A, auto & B) { return s; } #define AP(s) [&](auto & A) { s; } // ---- LL inversion_distance(vector const & a, vector const & b) { assert(SI(a) == SI(b)); int n = SI(a); { auto aa = a, bb = b; sort(ALL(aa)); sort(ALL(bb)); if(aa != bb) { return -1; } } map c; map, int> p; inc(i, n) { p[{ a[i], c[a[i]] }] = i; c[a[i]]++; } SegmentTree st(n, OP(A + B), 0); LL ans = 0; dec(i, n) { c[b[i]]--; int x = p[{ b[i], c[b[i]] }]; ans += st.fold_IX(0, x); st.apply(x, AP(A++)); } return ans; } int main() { auto f = [&](auto a, auto b) -> LL { if_not(a.FR == b.FR && a.BA == b.BA) { return -1; } int n = SI(a); vector aa(n - 1), bb(n - 1); inc(i, n - 1) { aa[i] = a[i] ^ a[i + 1]; } inc(i, n - 1) { bb[i] = b[i] ^ b[i + 1]; } return inversion_distance(aa, bb); }; auto n = in(); auto a = vin(n); auto b = vin(n); out(f(a, b)); }