//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
int get0(string s) {
    for (auto i : s) {
        if (i == '0')
            return -1;
    }
    return 0;
}
int get00(string s) {
    vector<int> ema;
    int cr = 0;
    for (auto i : s) {
        if (i == '1') {
            ema.push_back(cr);
            cr = 0;
        } else {
            cr++;
        }
    }
    ema.push_back(cr);
    sort(all(ema));
    int sm = 0;
    for (auto i : ema)
        sm += i;
    if (ema.size() < sm)
        return -1;
    int res = 0;
    for (auto i : ema) {
        if (i > 1)
            res += i - 1;
    }
    return res;
}
int get01(string s) {
    char prv = '?';
    int res = 0;
    for (auto i : s) {
        if (i == prv)
            continue;
        if (prv != '?' and i == '1')
            res++;
        prv = i;
    }
    return res;
}
int get010(string s) {
    int res = 0;
    string s2;
    for (auto i : s) {
        if (s2.empty())
            s2 += i;
        else if (s2.back() != '0' or i != '0')
            s2 += i;
    }
    s = s2;
    for (int i = 1; i + 1 < s.size(); ++i) {
        if (s[i-1] == '0' and s[i] == '1' and s[i + 1] == '0') {
            res++;
            if (i - 2 >= 1 and s[i - 2] == '1' and s[i-3] == '0') {
                s[i-1] = '1';
                s[i] = '0';
                res--;
            }
        }
    }
    //cout << s << '\n';
    return res;
}
int get001(string s) {
    char prv = '?';
    int res = 0;
    while (!s.empty() and s.back() == '0')
        s.pop_back();
    reverse(all(s));
    int cn = 0;
    for (auto i : s) {
        if (i == prv) {
            cn++;
            continue;
        }
        if (prv == '0' and cn >= 2)
            res++;
        prv = i;
        cn = 1;
    }
    if (prv == '0' and cn >= 2)
        res++;
    return res;
}
int get000(string s) {
    vector<int> ema;
    int cr = 0;
    for (auto i : s) {
        if (i == '1') {
            ema.push_back(cr);
            cr = 0;
        } else {
            cr++;
        }
    }
    ema.push_back(cr);
    sort(all(ema));
    int sm = 0;
    for (auto i : ema)
        sm += i;
    if (ema.size() * 2 < sm)
        return -1;
    vector<int> ema2;
    vector<int> cnt(3);
    int res = 0;
    for (int i = 0; i < ema.size(); ++i) {
        if (ema[i] > 2)
            ema2.push_back(ema[i]-2);
        else {
            cnt[ema[i]]++;
        }
    }
    for (auto &i : ema2) {
        while (i > 0 and cnt[2]) {
            cnt[2]--;
            i -= 2;
            res++;
        }
    }
    for (auto &i : ema2) {
        while (i > 0 and cnt[2]) {
            cnt[2]--;
            cnt[1]++;
            i -= 1;
            res++;
        }
        while (i > 0 and cnt[1]) {
            cnt[1]--;
            i -= 1;
            res++;
        }
    }
    return res;
}
void solve() {
    string s, t;
    cin >> s >> t;
    int cn = 0;
    for (auto i : t) {
        if (i == '0')
            cn++;
        else
            cn--;
    }
    if (cn < 0) {
        for (auto &i : t) {
            i = '1' - i + '0';
        }
        for (auto &i : s) {
            i = '1' - i + '0';
        }
    }
    if (t[0] != '0') {
        reverse(all(t));
        reverse(all(s));
    }
    //cout << s << '\n' << t << '\n';
    if (t == "0") {
        cout << get0(s) << '\n';
    }
    if (t == "00") {
        cout << get00(s) << '\n';
    }
    if (t == "01") {
        cout << get01(s) << '\n';
    }
    if (t == "000") {
        cout << get000(s) << '\n';
    }
    if (t == "001") {
        cout << get001(s) << '\n';
    }
    if (t == "010") {
        cout << get010(s) << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}