#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF int(1e9+1)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define F(n) FOR(i,0,n)
#define FF(n) FOR(j,0,n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX 55
#define GL(s) fgets(s,MX,stdin)
#define BR(C) (C==118||C==68)
#define NIN (min(x,y)<0||max(x,y)>=N)
#define A5(s) (string(1,*s)+string(1,s[1])+string(1,s[2]))
#define AN(C) (C==33||BR(C))
ll S;
int N,B[MX][MX],P[MX*MX],dx[]={1,-1,0,0},dy[]={0,0,1,-1},b,b7[MX][MX],NX[]={-2,-2,-1,-1,1,1,2,2},NY[]={1,-1,2,-2,2,-2,1,-1},b11=INF,z[MX][MX],b8[MX][MX];
char s[MX][MX];
int a1(int x,int y,int dx,int dy){
    if(NIN||s[x][y]==42)return 0;
    return s[x][y]^32?z[x][y]++?0:100:a1(x+dx,y+dy,dx,dy);
}
void a2(int x,int y,int n){
    if(NIN||B[x][y]||!BR(s[x][y]))return;
    B[x][y]=n;
    F(4)a2(x+dx[i],y+dy[i],n);
}
int b2(int x,int y){
    if(NIN||!BR(s[x][y]))return 0;
    return 1+b2(x,y+1);
}
int b3(int x,int y){return NIN||!BR(s[x][y])?60:0;}
int b4(int x,int y){
    if(NIN||s[x][y]^32)return 0;
    return 15+b4(x-1,y);
}
set<string> a5;
int a6(int x,int y){return NIN||!AN(s[x][y])?0:15;}
int a7(int x,int y,int c){
    if(NIN)return 7;
    if(b7[x][y]++)return 0;
    if(s[x][y]^32&&c)return 0;
    F(4)if(a7(x+dx[i],y+dy[i],c+1))return 7;
    return 0;
}
int a8(int x,int y){return NIN||!BR(s[x][y])||b8[x][y]++?0:200;}
vii a9;
bool a10(int x,int y){return !NIN&&s[x][y]==71;}
int b10(int x,int y){
    F(4)if(a10(x+dx[i],y+dy[i]))return 500;
    return 0;
}
map<char,int> a11;
bool a15(int x,int y){return !NIN&&s[x][y]==68;}
int b15(int x,int y){
    F(4)if(a15(x+dx[i],y+dy[i]))return 50;
    return 0;
}
int main(void){
    scanf("%d",&N),GL(*s);
    F(N)GL(s[i]);
    F(N)FF(N)if(BR(s[i][j])&&!B[i][j])a2(i,j,++b);//2
    F(N)FF(N){
        if(s[i][j]==42)FOR(k,-1,2)FOR(l,-1,2)if(k|l)S+=a1(i+k,j+l,k,l);//1
        if(B[i][j])P[B[i][j]]=max(P[B[i][j]],b2(i,j)); //2
        if(BR(s[i][j]))FT(0,4)S+=b3(i+dx[k],j+dy[k]);//3
        if(s[i][j]==94)S+=b4(i-1,j);//4+14
        if(i+2<N&&j+2<N)a5.insert(A5((s[i]+j))+A5((s[i+1]+j))+A5((s[i+2]+j)));//5
        if(s[i][j]==32)FT(0,4)S+=a6(i+dx[k],j+dy[k]);//6
        if(s[i][j]^32)CL(b7,0),S+=a7(i,j,0);//7
//        int a=S;
        if(s[i][j]==33)FT(0,8)S+=a8(i+NX[k],j+NY[k]);//8
//        D(S-a)
        if(s[i][j]==47&&s[i][j+1]==92)a9.PB({i,j});//9
        if(s[i][j]==68)S+=b10(i,j);//10
        if(s[i][j]^32)++a11[s[i][j]];//11
        else ++S;//12
        if(s[i][j]==71)S+=b15(i,j);//15
    }
    S+=500*accumulate(P,P+b+1,0);//2
    S+=a5.size();//5
    for(auto&h:a9){//9
        int d=0;//9
        for(auto&w:a9)d=max(d,abs(h.aa-w.aa)+abs(h.bb-w.bb)); //9
        S+=50*d;//9
    }//9
    for(auto&h:a11)b11=min(b11,h.bb);//11
    for(auto&h:a11)if(h.bb==b11)S+=b11*10;//11
    S+=a11[33]*a11[68]*a11[118];//13
    S+=3*min(a11[94],a11[71]);//16
    printf("%lld\n",S);
    return 0;
}