#include <map>
#include <vector>
#include <utility>
#include <iterator>
#include <functional>
#include <cstdio>
#include <array>
template<typename T> struct ScanfSpecifier{};
#define DEF(T,V) template<> struct ScanfSpecifier<T>{static constexpr const char* value = V;};
DEF(char*,"%s")DEF(int,"%d")DEF(double,"%lf")DEF(float,"%f")DEF(char,"%c")DEF(const char*,"%s")DEF(unsigned long,"%lu")DEF(unsigned int, "%u")
#ifdef _MSC_VER
DEF(long long int,"%I64d")
#else
DEF(long long int,"%lld")
#endif
#undef DEF
template<typename T> int RD(T& arg){return std::scanf(ScanfSpecifier<T>::value, &arg);}
template<int S> int RD(char (&arg)[S]){return std::scanf("%s", arg);}
int RD(char* arg){return std::scanf("%s", arg);}
template<> int RD<char>(char& arg){return std::scanf(" %c", &arg);}
template<typename T, typename... Args> int RD(T& arg1, Args&... args) {return RD(arg1) + RD(args...);}
template<typename T> T RD(){T ret; RD(ret); return ret;}
template<typename It> void RDV(It begin, It end) { while(begin != end) RD(*begin++); }
template<typename C> void RDV(C& c) {RDV(std::begin(c), std::end(c));}
template<typename T> void WT(T arg) {std::printf(ScanfSpecifier<T>::value, arg); }
template<typename T, typename U> void WT(std::pair<T, U> arg) {std::printf("("); WT(arg.first); std::printf(", "); WT(arg.second); std::printf(")");}
template<typename... Args> void WT(Args... args) { int alc = 0; int dummy[] = {((alc++? std::printf(" "): 0), WT(args), 0)...}; }

template<typename... Args> void WTL(Args... args) { WT(args...); std::printf("\n"); }
template<typename It> void WTV(It begin, It end) { int alc = 0; while(begin != end) (alc++? std::printf(" "): 0), WT(*begin++); }
template<typename C> void WTV(const C& c) {WTV(std::begin(c), std::end(c));}
template<typename It> void WTVL(It begin, It end) { WTV(begin, end); std::printf("\n"); }
template<typename C> void WTVL(const C& c) {WTVL(std::begin(c), std::end(c));}

#define _M_VARGS_NUM_IMPL(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, N, ...) N
#define _M_VARGS_NUM(...) _M_VARGS_NUM_IMPL(__VA_ARGS__, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)
#define _W1(_1) (#_1[0] == '"' || #_1[0] == '\''? WT("", _1, ""): WT('[', #_1, '=', _1, ']'))
#define _W2(_1, _2) (_W1(_1), _W1(_2))
#define _W3(_1, _2, _3) (_W1(_1), _W2(_2, _3))
#define _W4(_1, _2, _3, _4) (_W1(_1), _W3(_2, _3, _4))
#define _W5(_1, _2, _3, _4, _5) (_W1(_1), _W4(_2, _3, _4, _5))
#define _W6(_1, _2, _3, _4, _5, _6) (_W1(_1), _W5(_2, _3, _4, _5, _6))
#define _W7(_1, _2, _3, _4, _5, _6, _7) (_W1(_1), _W6(_2, _3, _4, _5, _6, _7))
#define _W8(_1, _2, _3, _4, _5, _6, _7, _8) (_W1(_1), _W7(_2, _3, _4, _5, _6, _7, _8))
#define _WW_IMPL2(num, ...) _W ## num(__VA_ARGS__)
#define _WW_IMPL(num, ...) _WW_IMPL2(num, __VA_ARGS__)
#define WW(...) (std::printf("(%03d) ", __LINE__), _WW_IMPL(_M_VARGS_NUM(__VA_ARGS__), __VA_ARGS__), WTL(""))




struct Range
{   
    struct It {   int num, step; int operator*(){return num;} void operator++(){num += step;} bool operator!=(const It& other){return num != other.num;} };
    Range(int ee):b(0),e(ee){}
    Range(int bb, int ee):b(bb), e(ee){}
    It begin(){return {b, (b < e? 1: -1)};}
    It end(){return {e, 0};}
    int b, e;
};

template<typename T> inline T& UMAX(T& x, T y){if(x < y)x = y; return x;}
template<typename T> inline T& UMIN(T& x, T y){if(y < x)x = y; return x;}
template<typename T, typename... Args> struct ArithmiticPromotion { typedef decltype(T() + typename ArithmiticPromotion<Args...>::type()) type; };
template<typename T, typename U> struct ArithmiticPromotion<T, U> { typedef decltype(T() + U()) type; };
template<typename T> struct ArithmiticPromotion<T, T> { typedef T type; };
template<typename T> struct ArithmiticPromotion<T> { typedef T type; };
template<typename T, typename U> typename ArithmiticPromotion<T, U>::type MAX(T a, U b) { return a < b? b: a; }
template<typename T, typename... Args> typename ArithmiticPromotion<T, Args...>::type MAX(T a, Args... args) { return MAX(a, MAX(args...)); }
template<typename T, typename U> typename ArithmiticPromotion<T, U>::type MIN(T a, U b) { return a < b? a: b; }
template<typename T, typename... Args> typename ArithmiticPromotion<T, Args...>::type MIN(T a, Args... args) { return MIN(a, MIN(args...)); }





//alias
using RG = Range;
//RD[L],RDV[L],WT[L],WTV[L] for i/o
//template
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long int ll;

char A[2345], B[2345];

int l[2345], r[2345];

int main()
{
    RD(A, B);
    int N = strlen(A);

    bool check = false, check2 = false;
    for(int i: RG(N))
    {
        if(B[i] == '1')
            check = true;
        if(A[i] != B[i])
            check2 = true;
    }

    if(!check2)
    {
        WTL(0);
        return 0;
    }

    if(!check)
    {
        WTL(-1);
        return 0;
    }


    for(int i: RG(N))
    {
        while(B[(i - l[i] + N) % N] == '0')
            l[i]++;
        while(B[(i + r[i] + N) % N] == '0')
            r[i]++;
    }


    int ans = 10 * N;

    for(int i: RG(N))
    {
        int alc = 0;
        multiset<int> rr;
        multiset<pair<int, int>> ll;

        for(int j: RG(N))
            if(A[(i + j) % N] != B[j])
            {
                if(l[(i + j) % N] || r[(i + j) % N])
                {
                    ll.insert({l[(i + j) % N], r[(i + j) % N]});
                    rr.insert(r[(i + j) % N]);
                }
                alc++;
            }


        for(int j: RG(N))
        {
            while(ll.size() && ll.begin()->first <= j)
            {
                int v = ll.begin()->second;
                rr.erase(rr.find(v));
                ll.erase(ll.begin());
            }


            if(rr.size())
            {
                int t = *rr.rbegin();
                int s = (i + t) % N;
                UMIN(ans, alc + j + t + j + min(s, N - s));
            }
            else
            {
                int s = (i - j + N) % N;
                UMIN(ans, alc + j + min(s, N - s));
            }
        }
    }


    for(int i: RG(N))
    {
        int alc = 0;
        multiset<int> rr;
        multiset<pair<int, int>> ll;

        for(int j: RG(N))
            if(A[(i + j) % N] != B[j])
            {
                if(l[(i + j) % N] || r[(i + j) % N])
                {
                    ll.insert({r[(i + j) % N], l[(i + j) % N]});
                    rr.insert(l[(i + j) % N]);
                }
                alc++;
            }


        for(int j: RG(N))
        {
            while(ll.size() && ll.begin()->first <= j)
            {
                int v = ll.begin()->second;
                rr.erase(rr.find(v));
                ll.erase(ll.begin());
            }


            if(rr.size())
            {
                int t = *rr.rbegin();
                int s = (i - t + N) % N;
                UMIN(ans, alc + j + t + j + min(s, N - s));
            }
            else
            {
                int s = (i + j + N) % N;
                UMIN(ans, alc + j + min(s, N - s));
            }
        }
    }
    WTL(ans);
}






Measured memory_bytes: 512