#include <bits/stdc++.h>
#include <omp.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;


//#define int ll
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());


typedef pair<int, int> pii;
typedef pair<string, string> pst;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef pair<pld, pld> pldd;
typedef vector<pld> vpd;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define my_abs(a) (((a) >= 0) ? (a) : -(a))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define MODIK(a) (a >= M ? a - M : a)
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef ART_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


istream &operator >> (istream &in, pld &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pld &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void print(int a, int b, int n, vi h)
{
    ofstream cout("output.txt");
    cout << SZ(h) << ' ' << a << ' ' << b << '\n';
    for (int i = 0; i < SZ(h); ++i) {
        cout << h[i]  << ' ';
    }
    cout.close();
    exit(0);
}


inline bool break_time(ld time)
{
    return clock() > CLOCKS_PER_SEC * time;
}


ld get_rand_ld(ld l, ld r)
{
    uniform_real_distribution<double> gen(l, r);
    return gen(rng);
}


bool may(int E, ld T)
{
    if (E < 0)
        return 1;

    double eps = get_rand_ld(0, 1);
    return eps < exp(-E / T);
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(10) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 2e5 + 100, B = 50, oo = 1e9 + 100, M = 998244353;
const int M1 = 1000000093, x1 = 27162;
const int M2 = 1000000087, x2 = 241;
const ld pi = atan2(1, 0) * 2, EPS = 1e-9;


vi lft, rght;


bool comp2(int a, int b)
{
    return rght[a] < rght[b];
}


bool comp1(int a, int b)
{
    return lft[a] < lft[b];
}


int solution(string a, string b)
{
    if (a == b)
        return 0;

    if (count(ALL(b), '1') == 0)
        return -1;

    b = b + b + b;
    int n = SZ(a);

    vi cnt(3 * n);
    cnt[0] = b[0] - '0';
    for (int i = 1; i < 3 * n; ++i)
        cnt[i] += cnt[i - 1] + b[i] - '0';


    lft.resize(n);
    rght.resize(n);

    lft[0] = 0;
    while (b[n - lft[0]] != '1')
        lft[0]++;

    rght.back() = 0;
    while (b[2 * n - 1 + rght.back()] != '1')
        rght.back()++;

    for (int i = 1; i < n; ++i)
        if (b[n + i] == '1')
            lft[i] = 0;
        else
            lft[i] = lft[i - 1] + 1;

    for (int i = n - 2; i >= 0; --i)
        if (b[n + i] == '1')
            rght[i] = 0;
        else
            rght[i] = rght[i + 1] + 1;


    int ans = oo;
    //shift to left
    {
        for (int add = 0; add < n; ++add)
        {
            vi pos;
            int cnt = 0;
            int st = n - add;

            for (int i = 0; i < n; ++i)
            {
                if (b[st + i] != a[i])
                {
                    cnt++;
                    pos.push_back(i);
                }
            }

            if (!SZ(pos))
            {
                ans = min(ans, add);
                continue;
            }

            stable_sort(ALL(pos), comp2);
            vi val(SZ(pos));

            for (int i = 0; i < SZ(pos); ++i)
                val[i] = lft[pos[i]];

            for (int i = SZ(pos) - 2; i >= 0; --i)
                val[i] = max(val[i], val[i + 1]);

            int radd = rght[pos.back()];
            int ladd = max(val[0], add);

            ans = min(ans, cnt + 2 * radd + add);
            ans = min(ans, cnt + (ladd - add) * 2 + add);

            for (int i = 0; i + 1 < SZ(pos); ++i)
            {
                int radd = rght[pos[i]];
                int ladd = max(add, val[i + 1]);

                ans = min(ans, cnt + 2 * radd + (ladd - add) * 2 + add);
            }
        }
    }


    return ans;
}


void smain()
{
    string a, b;
    cin >> a >> b;
    int ans = solution(a, b);
//    cout << ans << '\n';
    reverse(ALL(a));
    reverse(ALL(b));
    ans = min(ans, solution(a, b));

    cout << ans;

}


Measured memory_bytes: 512