/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
     
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
     
/** Read */
     
static const int buf_size = 4096;
     
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
     
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
     
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
     
/** Write */
     
static int write_pos = 0;
static char write_buf[buf_size];
     
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
     
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
     
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
     
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
     
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
   
   
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228
#define y2 y2228
const int MAXN = 2001;


vector<int> g[MAXN];
int estleft[MAXN];


int main() {
    string a, b;
    cin >> a >> b;
    if (a == b) {
        cout << 0 << endl;
        return 0;
    }
    bool was = 0;
    for (int i = 0; i < sz(b); i++) {
        if (b[i] == '1') {
            was = true;
            break;
        }
    }
    if (!was) {
        cout << -1 << endl;
        return 0;
    }
    int ans = 1e9;
    for (int i = 0; i < sz(a); i++) {
        for (int j = 0; j < sz(b); j++) {
            if (b[j] == '1') {
                if (j >= i) {
                    g[i].push_back(j - i);
                    g[i].push_back(-(i + sz(b) - j));
                } else {
                    g[i].push_back(j - i);
                    g[i].push_back(sz(b) - i + j);
                }
            }
        }
        sort(all(g[i]));
    }
    for (int sd = 0; sd > -sz(a); sd--) {
        bool superbad = 0;
        multiset<int> lefts;
        set<pair<int, int> > rights;
        int cntbads = 0;
        for (int i = 0; i < sz(b); i++) {
            if (b[i] != a[(i - sd) % sz(a)]) {
                cntbads++;
                if (g[(i - sd) % sz(a)].empty()) {
                    superbad = true;
                    break;
                }
                auto it = lower_bound(all(g[(i - sd) % sz(a)]), sd);
                if (it != g[(i - sd) % sz(a)].end() && *it <= 0) {
                    continue;
                }
                if (it == g[(i - sd) % sz(a)].end()) {
                    it--;
                    lefts.insert(*it);
                } else {
                    rights.insert(make_pair(*it, (i - sd) % sz(a)));
                    if (it != g[(i - sd) % sz(a)].begin()) {
                        it--;
                        lefts.insert(*it);
                        estleft[(i - sd) % sz(a)] = *it;
                    } else {
                        estleft[(i - sd) % sz(a)] = -1;
                    }
                }
            }
        }
        if (superbad) {
            continue;
        }
        int cur = abs(sd) + cntbads;
        for (int rsd = 0; rsd < sz(a); rsd++) {
            while (!rights.empty() && rights.begin()->first <= rsd) {
                pair<int, int> ps = *rights.begin();
                rights.erase(ps);
                if (estleft[ps.second] != -1) {
                    lefts.erase(lefts.find(estleft[ps.second]));
                }
            }
            chkmin(ans, cur + (lefts.empty() ? 0: (sd - *lefts.begin()) * 2));
            cur += 2;
        }
    }
    reverse(all(a));
    reverse(all(b));
    for (int i = 0; i < sz(a); i++) {
        g[i].clear();
        for (int j = 0; j < sz(b); j++) {
            if (b[j] == '1') {
                if (j >= i) {
                    g[i].push_back(j - i);
                    g[i].push_back(-(i + sz(b) - j));
                } else {
                    g[i].push_back(j - i);
                    g[i].push_back(sz(b) - i + j);
                }
            }
        }
        sort(all(g[i]));
    }
    for (int sd = 0; sd > -sz(a); sd--) {
        bool superbad = 0;
        multiset<int> lefts;
        set<pair<int, int> > rights;
        int cntbads = 0;
        for (int i = 0; i < sz(b); i++) {
            if (b[i] != a[(i - sd) % sz(a)]) {
                cntbads++;
                if (g[(i - sd) % sz(a)].empty()) {
                    superbad = true;
                    break;
                }
                auto it = lower_bound(all(g[(i - sd) % sz(a)]), sd);
                if (it != g[(i - sd) % sz(a)].end() && *it <= 0) {
                    continue;
                }
                if (it == g[(i - sd) % sz(a)].end()) {
                    it--;
                    lefts.insert(*it);
                } else {
                    rights.insert(make_pair(*it, (i - sd) % sz(a)));
                    if (it != g[(i - sd) % sz(a)].begin()) {
                        it--;
                        lefts.insert(*it);
                        estleft[(i - sd) % sz(a)] = *it;
                    } else {
                        estleft[(i - sd) % sz(a)] = -1;
                    }
                }
            }
        }
        if (superbad) {
            continue;
        }
        int cur = abs(sd) + cntbads;
        for (int rsd = 0; rsd < sz(a); rsd++) {
            while (!rights.empty() && rights.begin()->first <= rsd) {
                pair<int, int> ps = *rights.begin();
                rights.erase(ps);
                if (estleft[ps.second] != -1) {
                    lefts.erase(lefts.find(estleft[ps.second]));
                }
            }
            chkmin(ans, cur + (lefts.empty() ? 0: (sd - *lefts.begin()) * 2));
            cur += 2;
        }
    }
    if (ans > 1e8) {
        cout << -1 << endl;
        return 0;
    }
    cout << ans << endl;
    return 0;   
}


Measured memory_bytes: 32384