#include #include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; // NOLINT using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false) template void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; } template void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; } template void input(Ts&... ts) { (cin >> ... >> ts); } template istream &operator,(istream &in, T &t) { return in >> t; } struct Inf { template constexpr operator T() { return numeric_limits::max() / 2; } }; // clang-format on int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; string s, t; cin, n, s, t; if (s.front() != t.front() || s.back() != t.back()) { print(-1); return 0; } vector vs, vt; rep(i, 0, n - 1) { vs.emplace_back((s[i] ^ s[i + 1]) & 1); vt.emplace_back((t[i] ^ t[i + 1]) & 1); } rep(i, 0, n - 1) { vs[i] = vs[i] ^ (i & 1); vt[i] = vt[i] ^ (i & 1); } vector zs, zt; rep(i, 0, n - 1) { if (vs[i]) zs.emplace_back(i); if (vt[i]) zt.emplace_back(i); } if (zs.size() != zt.size()) { print(-1); return 0; } ll ans = 0; rep(i, 0, zs.size()) { ans += abs(zs[i] - zt[i]); } print(ans); return 0; }