#include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n,ans=0;cin>>n; vs S(n);inp(S); vl C(n); rep(i,0,n){ auto &nS=S[i]; int cnt=0; rep(j,0,2*n){ if(nS[j]=='.'){ ans+=j-cnt; cnt++; } } C[i]=cnt; } stack st1,st2; rep(i,0,n){ auto c=C[i]; if(c==n)continue; else if(c=b){ c+=b; }else if(n-c0&&!st2.empty()){ auto[a,b]=st2.top();st2.pop(); if(m>=b){ ans+=b*(i-a); ans+=b*b; m-=b; }else{ ans+=m*(i-a); ans+=m*b; st2.push({a,b-m}); m=0; } } if(m>0)st1.push({i,m}); } } cout<