#include <bits/stdc++.h>
using namespace std;
int solve(string s,string t,int i,int n)
{
int swaps=0;
int sBigger = false;
if(s[i]>t[i])
sBigger = true;
i++;
while(i<n)
{
if(sBigger){
if(s[i]>t[i])
swaps++;
} else//sBigger false then means t starting is bigger so if t[i]>s[i] do swaps
{
if(s[i]<t[i])
{
swaps++;
}
}
i++;
}
return swaps;
}
int main() {
// your code goes here
string s1,s2;
cin>>s1>>s2;
int i=0;
int n = s1.size();
while(i<n && s1[i]==s2[i])
{
i++;
}
int way1 = solve(s1,s2,i,n);
int way2 = 1+solve(s1,s2,i,n);
cout<<min(way1,way2);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBzb2x2ZShzdHJpbmcgcyxzdHJpbmcgdCxpbnQgaSxpbnQgbikKewogICAgaW50IHN3YXBzPTA7CiAgICBpbnQgc0JpZ2dlciA9IGZhbHNlOwogICAgaWYoc1tpXT50W2ldKQogICAgICAgIHNCaWdnZXIgPSB0cnVlOwogICAgaSsrOwogICAgd2hpbGUoaTxuKQogICAgewogICAgICAgIGlmKHNCaWdnZXIpewogICAgICAgICAgICBpZihzW2ldPnRbaV0pCiAgICAgICAgICAgICAgICBzd2FwcysrOwogICAgICAgICAgCn0gICAgICAgIGVsc2UvL3NCaWdnZXIgZmFsc2UgdGhlbiBtZWFucyAgdCBzdGFydGluZyAgaXMgYmlnZ2VyIHNvIGlmIHRbaV0+c1tpXSBkbyBzd2FwcwogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpZihzW2ldPHRbaV0pCiAgICAgICAgICAgICAgICB7CiAgICAgICAgICAgICAgICAgICAgIHN3YXBzKys7CiAgICAgICAgICAgICAgICAgICAKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgICAgCiAgICAgICAgICAgIH0KICAgICAgICBpKys7CiAgICB9CiAgICByZXR1cm4gc3dhcHM7Cn0KaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglzdHJpbmcgczEsczI7CgljaW4+PnMxPj5zMjsKCWludCBpPTA7CglpbnQgbiA9IHMxLnNpemUoKTsKCXdoaWxlKGk8biAmJiBzMVtpXT09czJbaV0pCgl7CgkgICBpKys7Cgl9CglpbnQgd2F5MSA9IHNvbHZlKHMxLHMyLGksbik7CglpbnQgd2F5MiA9IDErc29sdmUoczEsczIsaSxuKTsKCWNvdXQ8PG1pbih3YXkxLHdheTIpOwoJcmV0dXJuIDA7Cgp9Cg==