#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;

int n, m;
vector<int> s, t;

ll solve() {
    if (t[0] == 1) {
        for (int i = 0; i < n; i += 1) {
            s[i] ^= 1;
        }
        for (int i = 0; i < m; i += 1) {
            t[i] ^= 1;
        }
    }
    if (m == 1) {
        for (int i = 0; i < n; i += 1) {
            if (s[i] == 0) {
                return -1;
            }
        }
        return 0;
    }
    if (m == 2) {
        if (t[0] != t[1]) {
            int count = 0;
            for (int i = 0; i + 1 < n; i += 1) {
                if (s[i] == 0 && s[i + 1] == 1) {
                    count += 1;
                }
            }
            return count;
        } else {
            int zero_count = 0;
            for (int i = 0; i < n; i += 1) {
                if (s[i] == 0) {
                    zero_count += 1;
                }
            }
            if (zero_count > (n + 1) / 2) {
                return -1;
            }
            int count = 0;
            for (int i = 0; i + 1 < n; i += 1) {
                if (s[i] == 0 && s[i + 1] == 0) {
                    count += 1;
                }
            }
            return count;
        }
    }
    if (t[0] != t[2]) {
        if (t[1] == 1) {
            reverse(all(s));
            reverse(all(t));
            for (int i = 0; i < n; i += 1) {
                s[i] ^= 1;
            }
            for (int i = 0; i < m; i += 1) {
                t[i] ^= 1;
            }
        }
        int count = 0;
        for (int i = 0; i + 2 < n; i += 1) {
            if (s[i] == 0 && s[i + 1] == 0 && s[i + 2] == 1) {
                count += 1;
            }
        }
        return count;
    }
    if (t[0] != t[1]) {
        int count = 0;
        for (int i = 0; i + 2 < n; i += 1) {
            if (s[i] == 0 && s[i + 1] == 1 && s[i + 2] == 0) {
                count += 1;
            }
        }
        return (count + 1) / 2;
    }
    vector<int> lns;
    int sm_ln = 0;
    int l = 0;
    for (int i = 0; i <= n; i += 1) {
        if (i == n || s[i] == 1) {
            lns.push_back(i - l);
            sm_ln += i - l;
            l = i + 1;
        }
    }
    int sgs_cnt = (int)lns.size();
    if (sgs_cnt * 2 < sm_ln) {
        return -1;
    }
    int new_sgs_cnt = 0;
    int rs = 0;
    int zero_count = 0;
    int one_count = 0;
    for(auto ln : lns){
        if(ln == 0){
            zero_count += 1;
        } else if(ln == 1){
            one_count += 1;
        }
    }
    for (auto ln : lns) {
        while(ln >= 3){
            if(ln >= 4){
                if(zero_count == 0){
                    rs += 1;
                    one_count -= 2;
                    zero_count += 1;
                }
                zero_count -= 1;
                rs += 1;
                ln -= 2;
            } else{
                if(one_count > 0){
                    one_count -= 1;
                } else{
                    one_count += 1;
                    zero_count -= 1;
                }
                rs += 1;
                ln -= 1;
            }
        }
    }
    return rs;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    string ss, ts;
    cin >> ss >> ts;
    n = ss.size();
    m = ts.size();
    s.resize(n);
    for (int i = 0; i < n; i += 1) {
        s[i] = (ss[i] - '0');
    }
    t.resize(m);
    for (int i = 0; i < m; i += 1) {
        t[i] = (ts[i] - '0');
    }
    cout << solve() << "\n";
    return 0;
}