Rock_Paper_Scissor.cpp

///   ***   ---   |||		 In the name of ALLAH		|||   ---   ***   ///

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef double dl;

#define endl '\n'
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(x) (int)x.size()

const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const ll infLL = 9000000000000000000;
#define MOD 1000000007

#define mem(a, b) memset(a, b, sizeof(a))
#define sqr(a) ((a) * (a))

#define optimize()                \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define fraction()                \
    cout.unsetf(ios::floatfield); \
    cout.precision(10);           \
    cout.setf(ios::fixed, ios::floatfield);
#define file()                        \
    freopen("input.txt", "r", stdin); \
    freopen("output.txt", "w", stdout);
//
// debug
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << "{";
    for (auto it = v.begin(); it != v.end(); ++it)
    {
        if (it != v.begin())
            os << ", ";
        os << *it;
    }
    return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v)
{
    os << "[";
    for (auto it = v.begin(); it != v.end(); ++it)
    {
        if (it != v.begin())
            os << ",";
        os << *it;
    }
    return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v)
{
    os << "[";
    for (auto it = v.begin(); it != v.end(); ++it)
    {
        if (it != v.begin())
            os << ", ";
        os << *it;
    }
    return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v)
{
    os << "[";
    for (auto it = v.begin(); it != v.end(); ++it)
    {
        if (it != v.begin())
            os << ", ";
        os << it->first << " = " << it->second;
    }
    return os << "]";
}
#define dbg(args...)            \
    do                          \
    {                           \
        cerr << #args << " : "; \
        faltu(args);            \
    } while (0)
void faltu() { cerr << endl; }
template <typename T>
void faltu(T a[], int n)
{
    for (int i = 0; i < n; ++i)
        cerr << a[i] << ' ';
    cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest)
{
    cerr << arg << ' ';
    faltu(rest...);
}
// #else
// #define dbg(args...)

ll gcd(ll a, ll b) { return __gcd(a, b); }
ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }

int dx[] = {0, 0, +1, -1, -1 + 1, -1, +1};
int dy[] = {+1, -1, 0, 0, -1, +1, +1, -1};

const int mx = 2e5 + 123;
vi t[mx * 3];
int a[mx];

void init(int id, int b, int e)
{
    if (b == e)
    {
        t[id].pb(a[b]);
        return;
    }

    int mid = (b + e) >> 1;

    init(id * 2, b, mid);
    init(id * 2 + 1, mid + 1, e);

    merge(all(t[id * 2]), all(t[id * 2 + 1]), back_inserter(t[id]));
}

int ask(int id, int b, int e, int i, int j, int val)
{
    if (b > j || e < i)
        return 0;
    if (b >= i && e <= j)
    {
        return (lower_bound(all(t[id]), val) - t[id].begin());
    }

    int mid = (b + e) >> 1;

    int ret1 = ask(id * 2, b, mid, i, j, val);
    int ret2 = ask(id * 2 + 1, mid + 1, e, i, j, val);

    return ret1 + ret2;
}
void solve()
{
    int n;
    cin >> n;
    string he, she;
    cin >> he >> she;
    int h = 0, s = 0;
    for (int i = 0; i < n; i++)
    {
        if (he[i] == 'R' && she[i] == 'S')
            h++;
        else if (he[i] == 'S' && she[i] == 'P')
            h++;
        else if (he[i] == 'P' && she[i] == 'R')
            h++;
        else if (he[i] == 'S' && she[i] == 'R')
            s++;
        else if (he[i] == 'P' && she[i] == 'S')
            s++;
        else if (he[i] == 'R' && she[i] == 'P')
            s++;
    }

    if (s >= h)
    {
        int ans = ((s + h) / 2) + 1 - h;
        cout << ans << endl;
        return;
    }
    cout << 0 << endl;
    return;
}
int main()
{
    optimize();
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}