#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <algorithm> #include <climits> #include <cstring> #include <string> #include <set> #include <map> #include <queue> #include <stack> #include <vector> #include <list> #include <ext/rope> #define rep(i,m,n) for(i=m;i<=n;i++) #define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++) #define vi vector<int> #define pii pair<int,int> #define mod 1000000007 #define inf 0x3f3f3f3f #define pb push_back #define mp make_pair #define fi first #define se second #define ll long long #define pi acos(-1.0) const int maxn=10; const int dis[][2]={0,1,-1,0,0,-1,1,0}; using namespace std; using namespace __gnu_cxx; ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);} ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;} int n,m,ma; char a[maxn][maxn]; void dfs(int p,int cnt) { if(p==n*n){ma=max(ma,cnt);return;} int x=p/n,y=p%n; dfs(p+1,cnt); if(a[x][y]=='.') { int ok=1; for(int i=x;i<=n-1;i++){if(a[i][y]=='X')break;if(a[i][y]=='Q')ok=0;} for(int i=x;i>=0;i--){if(a[i][y]=='X')break;if(a[i][y]=='Q')ok=0;} for(int i=y;i<=n-1;i++){if(a[x][i]=='X')break;if(a[x][i]=='Q')ok=0;} for(int i=y;i>=0;i--){if(a[x][i]=='X')break;if(a[x][i]=='Q')ok=0;} if(ok)a[x][y]='Q',dfs(p+1,cnt+1),a[x][y]='.'; } } int main() { int i,j,k,t; while(~scanf("%d",&n)&&n) { ma=0; rep(i,0,n-1)scanf("%s",a[i]); dfs(0,0); printf("%d\n",ma); } return 0; }