#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
typedef long long ll;
const int N=105;
char a[N][N];
int n;
ll res;
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
bool in(int x,int y) {
    return x>=1 && x<=n && y>=1 && y<=n;
}
bool on_border(int x,int y) {
    return x==1 || x==n || y==1 || y==n;
}
void solve1() {
    FOR(i,1,n) FOR(j,1,n) if(a[i][j]!=' ' && a[i][j]!='*') {
        int w=0;
        DOR(k,i-1,1) {
            if(a[k][j]=='*') w=1;
            else if(a[k][j]!=' ') break;
        }
        FOR(k,i+1,n) {
            if(a[k][j]=='*') w=1;
            else if(a[k][j]!=' ') break;
        }
        DOR(k,j-1,1) {
            if(a[i][k]=='*') w=1;
            else if(a[i][k]!=' ') break;
        }
        FOR(k,j+1,n) {
            if(a[i][k]=='*') w=1;
            else if(a[i][k]!=' ') break;
        }
        int x,y;
        x=i,y=j;
        while(true) {
            --x,--y;
            if(!in(x,y)) break;
            if(a[x][y]=='*') w=1;
            else if(a[x][y]!=' ') break;
        }
        x=i,y=j;
        while(true) {
            --x,++y;
            if(!in(x,y)) break;
            if(a[x][y]=='*') w=1;
            else if(a[x][y]!=' ') break;
        }
        x=i,y=j;
        while(true) {
            ++x,--y;
            if(!in(x,y)) break;
            if(a[x][y]=='*') w=1;
            else if(a[x][y]!=' ') break;
        }
        x=i,y=j;
        while(true) {
            ++x,++y;
            if(!in(x,y)) break;
            if(a[x][y]=='*') w=1;
            else if(a[x][y]!=' ') break;
        }
        if(w) res+=100;
    }
    // cerr << res << endl;
}
bool is_bird(int x,int y) {
    return a[x][y]=='v' || a[x][y]=='D';
}
int mark[N][N];
void dfs2(int x,int y,int c) {
    if(!in(x,y)) return ;
    if(!is_bird(x,y)) return ;
    if(mark[x][y]) return ;
    mark[x][y]=c;
    FOR(i,0,3) dfs2(x+dx[i],y+dy[i],c);
}
void solve2() {
    int c=0;
    FOR(i,1,n) FOR(j,1,n) {
        if(!mark[i][j] && is_bird(i,j)) {
            ++c;
            dfs2(i,j,c);
        }
    }
    int mx[N*N];
    FOR(i,1,c) mx[i]=0;
    FOR(i,1,n) {
        int l=0;
        FOR(j,1,n) {
            if(mark[i][j]==mark[i][j-1]) l++;
            else l=1;
            mx[mark[i][j]]=max(mx[mark[i][j]],l);
        }
    }
    FOR(i,1,c) res+=mx[i]*500;
    // cerr << res << endl;
    FOR(i,1,n) FOR(j,1,n) {
        if(is_bird(i,j)) {
            if(!is_bird(i+1,j)) res+=60;
            if(!is_bird(i-1,j)) res+=60;
            if(!is_bird(i,j+1)) res+=60;
            if(!is_bird(i,j-1)) res+=60;
        }
    }
    // cerr << res << endl;
}
bool is_animal(int x,int y) {
    return is_bird(x,y) || a[x][y]=='!';
}
void solve3() {
    FOR(i,1,n) FOR(j,1,n) if(a[i][j]=='^') {
        DOR(k,i-1,1) {
            if(a[k][j]==' ') res+=15;
            else break;
        }
    }
    map<vector<char>,bool> vis;
    FOR(i,1,n-2) FOR(j,1,n-2) {
        vector<char> g;
        FOR(k,0,2) FOR(h,0,2) g.push_back(a[i+k][j+h]);
        if(!vis[g]) ++res;
        vis[g]=1;
    }

    FOR(i,1,n) FOR(j,1,n-1) {
        if(a[i][j]==' ' && is_animal(i,j+1)) res+=15;
        if(a[i][j+1]==' ' && is_animal(i,j)) res+=15;
    }
    FOR(i,1,n-1) FOR(j,1,n) {
        if(a[i][j]==' ' && is_animal(i+1,j)) res+=15;
        if(a[i+1][j]==' ' && is_animal(i,j)) res+=15;
    }
}
void solve4() {
    queue<pair<int,int>> Q;
    FOR(i,1,n) FOR(j,1,n) mark[i][j]=0;
    FOR(i,1,n) FOR(j,1,n) {
        if(on_border(i,j)) {
            if(a[i][j]==' ') {
                Q.push({i,j});
                mark[i][j]=1;
            }
        }
    }
    while(Q.size()) {
        auto [x,y]=Q.front();
        Q.pop();
        FOR(i,0,3) {
            int nx=x+dx[i];
            int ny=y+dy[i];
            if(in(nx,ny) && a[nx][ny]==' ' && !mark[nx][ny]) {
                Q.push({nx,ny});
                mark[nx][ny]=1;
            }
        }
    }
    FOR(i,1,n) FOR(j,1,n) if(a[i][j]!=' ') {
        int w=on_border(i,j);
        FOR(k,0,3) {
            int x=i+dx[k],y=j+dy[k];
            if(mark[x][y]) w=1;
        }
        if(w) {
            // cerr << i << ' ' << j << ' ' << endl;
            res+=7;
        }
    }
}
void solve5() {
    FOR(i,1,n) FOR(j,1,n) if(is_bird(i,j)) {
        int w=0;
        for(auto x: {i-2,i+2}) for(auto y: {j-1,j+1}) if(in(x,y) && a[x][y]=='!') w=1;
        for(auto x: {i-1,i+1}) for(auto y: {j-2,j+2}) if(in(x,y) && a[x][y]=='!') w=1;
        if(w) {
            // cerr << i << ' ' << j << endl;
            res+=200;
        }
    }
}
void solve6() {
    vector<pair<int,int>> v;
    FOR(i,1,n) FOR(j,1,n-1) {
        if(a[i][j]=='/' && a[i][j+1]=='\\') {
            v.push_back({i,j});
        }
    }
    for(auto [x1,y1]: v) {
        int d=0;
        for(auto [x2,y2]: v) {
            d=max(d,abs(x1-x2)+abs(y1-y2));
        }
        res+=d*50;
    }
}
int sz[300];
void solve7() {
    FOR(i,1,n) FOR(j,1,n) if(a[i][j]=='D') {
        int w=0;
        FOR(k,0,3) {
            int x=i+dx[k],y=j+dy[k];
            if(a[x][y]=='G') w=1;
        }
        if(w) res+=500;
    }
    FOR(i,1,n) FOR(j,1,n) if(a[i][j]==' ') ++res;
    FOR(i,1,n) FOR(j,1,n) sz[a[i][j]]++;
    int mn=1e9;
    vector<char> vc={'*','^','!','/','\\','v','D','G'};
    for(auto c: vc) if(sz[c]) mn=min(mn,sz[c]);
    for(auto c: vc) if(mn==sz[c]) res+=sz[c]*10;

    res+=1ll*sz['!']*sz['v']*sz['D'];

    FOR(i,1,n) FOR(j,1,n) if(a[i][j]=='G') {
        int w=0;
        FOR(k,0,3) {
            int x=i+dx[k],y=j+dy[k];
            if(a[x][y]=='D') w=1;
        }
        if(w) res+=50;
    }
    res+=3*min(sz['^'],sz['G']);
}
int main() {
    scanf("%d",&n);
    string str;
    getline(cin, str);
    FOR(i,1,n) {
        getline(cin, str);
        FOR(j,1,n) a[i][j]=str[j - 1];
    }
    // cerr << a[2][n] << endl;
    solve1();
    solve2();
    solve3();
    // cerr << " -- " << endl;
    solve4();
    // cerr << res << endl;
    solve5();
    solve6();
    // cerr << res << endl;
    solve7();

    cout << res << endl;
    return 0;
}