#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 #include<bitset>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn=+;

 char s[maxn];

 bitset<maxn> bit1[maxn],bit2[maxn];

 int main()

 {

     //freopen("in.txt","r",stdin);

     freopen("triatrip.in","r",stdin);

     freopen("triatrip.out","w",stdout);

     int n;

     scanf("%d",&n);

     for(int i=;i<n;i++)

     {

         scanf("%s",s);

         for(int j=;j<n;j++)

         {

             if(s[j]=='+')  bit1[i].set(j),bit2[j].set(i);

             //bit1记录i能够到达的点，bit2记录能够到达j的点

         }

     }

     ll ans = ;

     for(int i=;i<n;i++)

     {

         for(int j=;j<n;j++)

         {

             if(bit1[i][j])

             {

                 ans+=(bit1[j]&bit2[i]).count();

             }

         }

     }

     printf("%lld\n",ans/);

     return ;

 }