#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
//const int INF = 1 << 30;//10^9
const ll INF = INFL;
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, -1, 0, 1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){cout << fixed << setprecision(10) << A << endl;}
//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//素因数列挙
vector<ll> MakePrimeList(ll x) {
    vector<ll> res;
    for(ll k=2; k*k<=x; k++) {
        if(x % k == 0) {
            res.pb(k);
            while(x % k == 0) x /= k;
        }
    }
    if(x > 1) res.push_back(x);
    return res;
}


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}


ll solve(string A, string B){
  B += B + B;
  ll N = A.size();
  vector<ll> left(3 * N, -INFL), right(3 * N, INFL);
  rep(i, 3 * N){
    if(i == 0) continue;
    if(B[i] == '1') left[i] = i;
    else{
      left[i] = left[i-1];
    }
  }
  revrep(i, 3 * N){
    if(i == 3 * N - 1) continue;
    if(B[i] == '1') right[i] = i;
    else{
      right[i] = right[i+1];
    }
  }
  ll ans = INFL;
  rep(i, N){
    ll res = i;
    vector<pair<ll, ll>> vis;
    rep(j, N){
      if(A[j] != B[j+i+N]){
        res++;
        if(right[j+N] <= j+i+N) continue;
        if(j+N <= left[j+i+N]) continue;
        vis.pb({(j+N) - left[j+N], right[j+i+N] - (j+i+N)});
      }
    }
    if(vis.size() == 0){
      ans = min(ans, res);
      continue;
    }
    //visについて解く
    sort(vis.begin(), vis.end());
    reverse(vis.begin(), vis.end());
    ll m = vis[0].f;
    ll tmp = 0;
    rep(j, vis.size()-1){
      tmp = max(tmp, vis[j].s);
      m = min(m, vis[j+1].f + tmp);
    }
    ll Ms = 0;
    rep(j, vis.size()){
      Ms = max(Ms, vis[j].s);
    }
    m = min(m, Ms);
    res += m * 2;
    ans = min(ans, res);
  }
  return ans;
}


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  string A, B;
  cin >> A >> B;
  bool all0A = 1, all0B = 1;
  rep(i, A.size()){
    if(A[i] == '1') all0A = 0;
    if(B[i] == '1') all0B = 0;
  }
  if(all0A == 1 && all0B == 1){
    cout << 0 << endl;
    return 0;
  }
  if(all0B == 1){
    cout << -1 << endl;
    return 0;
  }

  ll ans1 = solve(A, B);
  reverse(A.begin(), A.end());
  reverse(B.begin(), B.end());
  ll ans2 = solve(A, B);
  cout << min(ans1, ans2) << endl;
}


Measured memory_bytes: 468