#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve() {
  int n;
  cin >> n;
  string s, t;
  cin >> s >> t;
  vector<int> A(n);
  for (int i = 0; i < n; ++i)
    A[i] = (s[i] - '0') ^ (t[i] - '0');
  vector<pair<int, int>> segms;
  for (int i = 0; i < n;) {
    if (A[i] == 0) {
      ++i;
      continue;
    }
    int j = i;
    while (j < n && A[j] == 1)
      ++j;
    segms.emplace_back(i, j);
    i = j;
  }
  if (segms.empty()) {
    cout << n * 1ll * (n + 1) / 2 << '\n';
  } else if (segms.size() == 1) {
    cout << 2 * (n - 1) << '\n';
  } else {
    cout << 6 << '\n';
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}