#include<bits/stdc++.h>
#include "dna.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,sum,tptp;
const ll mx = 1e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
string k1,k2;
ll cnt[2][mx][3];
ll fun[mx][6];
unordered_map<char,ll> hashe;
void init(string a, string b){
hashe['T'] = 0;
hashe['A'] = 1;
hashe['C'] = 2;
k1 = a;
k2 = b;
memset(cnt,0ll,sizeof(cnt));
memset(fun,0ll,sizeof(fun));
n = k1.size();
fip(0,n){
fjp(0,3){
cnt[0][i+1][j] = cnt[0][i][j] + (hashe[k1[i]]==j);
cnt[1][i+1][j] = cnt[1][i][j] + (hashe[k2[i]]==j);
}
fjp(0,6){
fun[i+1][j] = fun[i][j];
}
if(k1[i]=='T' && k2[i]=='A')
fun[i+1][0]++;
else if(k1[i]=='A' && k2[i]=='T')
fun[i+1][3]++;
else if(k1[i]=='T' && k2[i]=='C')
fun[i+1][1]++;
else if(k1[i]=='C' && k2[i]=='T')
fun[i+1][4]++;
else if(k1[i]=='C' && k2[i]=='A')
fun[i+1][2]++;
else if(k1[i]=='A' && k2[i]=='C')
fun[i+1][5]++;
}
return;
}
int get_distance(int xx,int yy){
xx++,yy++;
fip(0,3){
ll tp1 = cnt[0][yy][i] - cnt[0][xx-1][i];
ll tp2 = cnt[1][yy][i] - cnt[1][xx-1][i];
debug(tp1);
debug(tp2);
if(tp1 != tp2)
return -1;
}
int ans = 0;
int tn=0,kc;
fip(0,3){
ll tp1 = fun[yy][i] - fun[xx-1][i];
ll tp2 = fun[yy][i+3] - fun[xx-1][3+i];
ans += min(tp1,tp2);
kc = max(tp1,tp2) - min(tp1,tp2);
tn += kc;
}
ans += (tn / 3) * 2;
return ans;
}
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
// cin>>n>>m;
// cin>>k1>>k2;
// ll sr,de;
// init(k1,k2);
// while(m--){
// cin>>sr>>de;
// cout<<get_distance(sr,de)<<nli;
// }
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
// return 0;
// }
