#include using namespace std; #define rep(i,a,b) for(ll i=a;i=b;i--) #define ll long long #define ull unsigned ll #define ld long double #define bl __int128_t #define fi first #define se second #define vel vector #define vvel vector #define pll pair #define vepll vector #define vvepll vector #define ves vector #define vem vector #define vvem vector #define pmm pair #define bl __int128_t #define cleout(i) cout<using PQ=priority_queue,greater>; // 上 右 下 左 vector di={-1, 0, 1, 0}; vector dj={ 0, 1, 0,-1}; vector dx={ 0, 1, 0,-1}; vector dy={ 1, 0,-1, 0}; vector ddx={ 1, 1, 1, 0, -1, -1, -1, 0 }; vector ddy={ 1, 0, -1, -1, -1, 0, 1, 1 }; ll inf=1000000000000000000;//1e18 // LLONG_MAX mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count()); //[x^M]1/(1-x)^N=comb(N-1+M,M) void _solve(){ ll N; cin>>N; vvel a(N,vel(2*N)); rep(i,0,N){ string S; cin>>S; rep(j,0,2*N){ if(S[j]=='#')a[i][j]=1; } } vel l(2*N); rep(i,0,N){ rep(j,0,2*N){ if(a[i][j]==0)l[j]++; } } ll ans=0; ll id=0; rep(i,0,N){ ll cnt=0; while(id<2*N){ if(l[id]==0){ id++; }else{ cnt++; ans+=abs(id-i); l[id]--; } if(cnt==N)break; } } id=0; vel r(N); rep(i,0,N){ rep(j,0,2*N){ if(a[i][j]==0)r[i]++; } } rep(i,0,N){ ll cnt=0; while(id<2*N){ if(r[id]==0){ id++; }else{ cnt++; ans+=abs(id-i); r[id]--; } if(cnt==N)break; } } cout<>_; else _=1; rep(__,0,_){ _solve(); } }