uva11552

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1007,INF = 0x3f3f3f3f;
int k;
string str;

struct Node {
	int arr[26];
	int cnt;

	void Clear() {
		cnt = 0;
		memset(arr, 0, sizeof(arr));
	}

	int Get(int first,int last) {
		if (!arr[first] || !arr[last]) return INF;
		if (first != last) return cnt;
		if (arr[first] == 1) {
			return cnt == 1 ? 1 : INF;
		}
		return cnt == 1?1:cnt + 1;
	}
	void Add(int index) {
		if (!arr[index]++)++cnt;
	}
}node[maxn];

int dp[maxn][26],val[26][26];

int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> k >> str;
		int len = str.size(),c = 1;
		node[c].Clear();
		for (int i = 0; i < len; i++) {
			if (i && i % k == 0) {
				node[++c].Clear();
			}
			node[c].Add(str[i] - 'a');
		}
		memset(dp, 0, sizeof(dp));
		
		for (int i = 1; i <= c; i++) {
			//当前组 j开头k结尾 有多少个块
			for (int j = 0; j < 26; j++) {
				for (int k = 0; k < 26; k++) {
					val[j][k] = node[i].Get(j, k);
				}
			}
			
			//计算当前以j结尾的最小块
			for (int j = 0; j < 26; j++) {
				dp[i][j] = INF;
				//和上一个k结尾的 连接当前串
				for (int k = 0; k < 26; k++) {
					//当前组 以l开头
					for (int l = 0; l < 26; l++) {
						int t = dp[i - 1][k] + val[l][j];
						//第一组没有前面的合并
						if (i != 1 && k == l) t -= 1;
						dp[i][j] = min(t, dp[i][j]);
					}
				}
			}
		}
		int ans = INF;
		for (int i = 0; i < 26; i++) {
			ans = min(dp[c][i], ans);
		}
		cout << ans << endl;
	}
	return 0;
}