#pragma GCC optimize("Ofast","unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ost;
#define endl "\n"
#define ll long long
#define ull unsigned long long
#define ld long double
#define pi pair<int,int>
#define pll pair<long long,long long>
#define vi vector<int>
#define vll vector<long long>
#define vpi vector<pair<int,int>>
#define vpll vector<pair<long long,long long>>
#define vvi vector<vector<int>>
#define vvll vector<vector<long long>>
#define vr vector<range<int>>
#define cd complex<double>
#define pb push_back
void frd(string s){
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
template<typename T>
struct matrix{
vector<T> mtx;
T Tdef;
int column=-1,row=-1;
matrix() {}
matrix(int r,int c) {
mtx.assign(r*c,Tdef);
row = r;
column = c;
}
matrix(int r,int c,T val){
mtx.assign(r*c,val);
row = r;
column = c;
}
struct proxy{
matrix *m ;
int i;
proxy(matrix* x , int y) : m(x) , i(y){}
T &operator[] (int j){
return (m->mtx[i*(m->row) + j]);
}
};
proxy operator[](int i){
return proxy(this,i);
}
void fill(T x){for(auto &y:mtx)y=x;}
void fill_row(int rw,T x,int l=0,int r=-1){
if(r==-1)r = column-1;
for(int i=l;i<=r;i++){
mtx[rw*row + i] = x;
}
}
void fill_column(int cl,T x,int l=0,int r=-1){
if(r == -1)r = row-1;
for(int i=l;i<=r;i++){
mtx[i*row + cl] = x;
}
}
void inc_row(int rw,T x,int l=0,int r=-1){
if(r==-1)r = column-1;
for(int i=l;i<=r;i++){
mtx[rw*row + i] += x;
}
}
void inc_column(int cl,T x,int l=0,int r=-1){
if(r == -1)r = row-1;
for(int i=l;i<=r;i++){
mtx[i*row + cl] +=x;
}
}
int count(int rw,T x,int l=0,int r=-1){
if(r == -1)r = column-1;
int cnt = 0;
for(int i=l;i<=r;i++)cnt += (mtx[rw*row + i] == x);
return cnt;
}
};
template<typename V,typename S> istream& operator >> (istream &x,pair<V,S> &p){cin >> p.first >> p.second ;return x;}
template<typename V,typename S> ostream& operator << (ostream &x,const pair<V,S> &p){cout << p.first <<" "<<p.second;return x;}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define abs(x) ((x)>0?(x):-((x)))
#define fr(i,j) for(int i=0;i<j;i++)
#define frt(a,b,c) for(int a=b;a<c;a++)
#define fra(x,y) for(auto &x:y)
#define min(a,b) ((a)<(b)?(a):(b))
#define all(x) x.begin(),x.end()
int mlog(int x) {
return 32 - __builtin_clz(x) - 1;
}
ll sum(ll a,ll b,ll M=1e+9+7){
a%=M;b%=M;return (a+b)%M;
}
ll subs(ll a,ll b,ll M=1e+9+7){
a-=b;a%=M;if(a<0)a+=M;return a;
}
ll mult(ll a,ll b,ll M=1e+9+7){
a%=M;b%=M;return (a*b)%M;
}
ll bp(ll a,ll b,ll M=1e+9+7){
if(b == 0)return 1;
if(b == 1)return a;
ll x = bp(a,b/2,M);
x = mult(x,x,M);
if(b%2)x=mult(x,a,M);
return x;
}
template<typename T,size_t N>
array<T,N> operator+ (const array<T,N> &a,const array<T,N> &b){
array<T,N> x;
fr(i,N)x[i] = a[i] + b[i];
return x;
}
template<typename T,size_t N>
array<T,N> operator- (const array<T,N> &a,const array<T,N> &b){
array<T,N> x;
fr(i,N)x[i] = a[i] - b[i];
return x;
}
template<typename T,size_t N>
array<T,N> get(int l,int r,vector<array<T,N>> &P){
if(l == 0)return P[r];
return P[r]-P[l-1];
}
int in(char c){
return (c=='A'?0:c=='C'?1:2);
}
int in2(char c,char p){
return 3*in(c) + in(p);
}
vector<array<int,3>> cntA ,cntB;
vector<array<int,9>> sgt;
void init(string A,string B){
fastio;
int N = A.size();
cntA.assign(N,array<int,3>());cntB.assign(N,array<int,3>());
fr(i,N){
cntA[i][in(A[i])]++;
cntB[i][in(B[i])]++;
}
for(int i=1;i<N;i++){
cntA[i] = cntA[i] + cntA[i-1];
cntB[i] = cntB[i] + cntB[i-1];
}
sgt.assign(N,array<int,9>());
fr(i,N){
sgt[i][in2(A[i],B[i])]++;
}
for(int i=1;i<N;i++){
sgt[i] = sgt[i] + sgt[i-1];
}
}
int get_distance(int x,int y){
if(get(x,y,cntA) != get(x,y,cntB))return -1;
auto a = get(x,y,sgt);
int res = 0;
// AA AC AT CA CC CT TA TC TT
int q = min(a[1],a[3]);res+=q;
a[1]-=q;a[3]-=q;
q = min(a[2],a[6]);res+=q;
a[2]-=q;a[6]-=q;
q = min(a[5],a[7]);res+=q;
a[5]-=q;a[7]-=q;
a[0]=a[4]=a[8]=0;
int mi = INT_MIN;
fra(t,a)mi = max(mi,t);
res += 2*mi;
return res;
}
/*
int32_t main(){
fastio;
string A = "ATACAT" , B = "ACTATA";
init(A,B);
//cout<<get_distance(1,3);
cout << get_distance(0,5) <<" " << get_distance(1,3) << " " << get_distance(4,5) << " " << get_distance(3,5);
}*/
