#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
string a, b;
int n;
void init(string x, string y) {
a = x;
b = y;
n = sz(a);
}
int get_distance(int x, int y) {
if(x == y) return (a[x] == b[x] ? 0 : -1);
if(y - x == 1) {
string s1 = "";
string s2 = "";
for(int i=x; i<=y; i++) s1 += a[i], s2 += b[i];
if(s1 == s2) return 0;
sort(all(s2));
sort(all(s1));
if(s1 != s2) return -1;
return 1;
}
if(y - x == 2) {
string s1 = "";
string s2 = "";
for(int i=x; i<=y; i++) s1 += a[i], s2 += b[i];
int ok = 0;
for(int i=0; i<sz(s1); i++) ok += (s1[i] == s2[i]);
sort(all(s1));
sort(all(s2));
if(s1 != s2) return -1;
if(ok == 3) return 0;
if(ok == 1) return 1;
if(ok == 0) return 2;
}
return 0;
}
// int32_t main() {
// setIO();
// string x, y;
// cin >> x >> y;
// init(x, y);
// cout << get_distance(0, 0) << '\n';
// cout << get_distance(0, 1) << '\n';
// cout << get_distance(0, 2) << '\n';
// return 0;
// }
