#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll sz = 1e5 + 5;
ll cnt[3][sz], tbl[3][3][sz], hsh[128];
void init(str a, str b)
{
a = ' ' + a;
b = ' ' + b;
hsh['A'] = 0;
hsh['C'] = 1;
hsh['T'] = 2;
for (ll i = 1; i < a.size(); i++)
{
cnt[hsh[a[i]]][i]++, cnt[hsh[b[i]]][i]--;
for (ll j = 0; j < 3; j++)
cnt[j][i] += cnt[j][i - 1];
for (ll j = 0; j < 3; j++)
for (ll k = 0; k < 3; k++)
tbl[j][k][i] = tbl[j][k][i - 1];
tbl[hsh[a[i]]][hsh[b[i]]][i]++;
}
}
int get_distance(int x, int y)
{
x++, y++;
ll t[3][3];
for (ll i = 0; i < 3; i++)
if (cnt[i][y] ^ cnt[i][x - 1])
return -1;
for (ll i = 0; i < 3; i++)
for (ll j = 0; j < 3; j++)
t[i][j] = tbl[i][j][y] - tbl[i][j][x - 1];
ll ans = 0, tmp = 0;
tmp = min(t[0][1], t[1][0]);
ans += tmp, t[0][1] -= tmp, t[1][0] -= tmp;
tmp = min(t[0][2], t[2][0]);
ans += tmp, t[0][2] -= tmp, t[2][0] -= tmp;
tmp = min(t[1][2], t[2][1]);
ans += tmp, t[1][2] -= tmp, t[2][1] -= tmp;
return ans + (max(t[0][1], t[1][0]) << 1);
}
void solve()
{
}
/*
*/
// int main()
// {
// sync
// // precomp();
// ll t = 1;
// // cin >> t;
// for (ll i = 1; i <= t; i++)
// // cout << "Case #" << i << ": ",
// solve();
// cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
// }
