#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
 
int main() {
	int t, n, a[1010][1010], x, y;
	char s[1000];
	scanf("%d", &t);
	while(t--) {
		memset(a, 0, sizeof(a));
		scanf("%d", &n);
		for(int i=0; i<n; i++) {
			scanf("%s", s);
			for(int j=0; j<n; j++) {
				if(s[j]=='P') a[i+5][j+5]++;
				else if(s[j]=='K') x=i+5, y=j+5;
			}
		}
		for(int j=n+4; j>=y; j--) {
			for(int i=n+4; i>4; i--) {
				a[i][j]+=max(max(a[i+1][j+2], a[i+2][j+1]), max(a[i-1][j+2], a[i-2][j+1]));
			}
		}
		printf("%d\n", a[x][y]);
	}
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y3N0ZGlvPgojaW5jbHVkZSA8Y3N0cmluZz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IHQsIG4sIGFbMTAxMF1bMTAxMF0sIHgsIHk7CgljaGFyIHNbMTAwMF07CglzY2FuZigiJWQiLCAmdCk7Cgl3aGlsZSh0LS0pIHsKCQltZW1zZXQoYSwgMCwgc2l6ZW9mKGEpKTsKCQlzY2FuZigiJWQiLCAmbik7CgkJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJCXNjYW5mKCIlcyIsIHMpOwoJCQlmb3IoaW50IGo9MDsgajxuOyBqKyspIHsKCQkJCWlmKHNbal09PSdQJykgYVtpKzVdW2orNV0rKzsKCQkJCWVsc2UgaWYoc1tqXT09J0snKSB4PWkrNSwgeT1qKzU7CgkJCX0KCQl9CgkJZm9yKGludCBqPW4rNDsgaj49eTsgai0tKSB7CgkJCWZvcihpbnQgaT1uKzQ7IGk+NDsgaS0tKSB7CgkJCQlhW2ldW2pdKz1tYXgobWF4KGFbaSsxXVtqKzJdLCBhW2krMl1baisxXSksIG1heChhW2ktMV1baisyXSwgYVtpLTJdW2orMV0pKTsKCQkJfQoJCX0KCQlwcmludGYoIiVkXG4iLCBhW3hdW3ldKTsKCX0KCXJldHVybiAwOwp9

MQo5ClBQUFBQUFBQUApQUFBQUFBQUFAKUFBQUFBQUFBQCktQUFBQUFBQUApQUFBQUFBQUFAKUFBQUFBQUFBQClBQUFBQUFBQUApQUFBQUFBQUFAKUFBQUFBQUFBQCg==

1
9
PPPPPPPPP
PPPPPPPPP
PPPPPPPPP
KPPPPPPPP
PPPPPPPPP
PPPPPPPPP
PPPPPPPPP
PPPPPPPPP
PPPPPPPPP