#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<string> a(n+5);
	string tt;
	getline(cin,tt);
	for(int i=1;i<=n;i++)
	{
		getline(cin,tt);
		a[i]=' '+tt;
	}
	auto inb=[&](int x,int y){return 1<=x and x<=n and 1<=y and y<=n;};
	auto isbird=[&](int x,int y){return (a[x][y]=='D' or a[x][y]=='v');};
	vector<vector<int>> illume(n+5,vector<int>(n+5));
	vector<int> dx={1,0,-1,0,1,1,-1,-1};
	vector<int> dy={0,1,0,-1,1,-1,1,-1};
	vector<int> ndx={1,2,-2,1,-1,2,-1,-2};
	vector<int> ndy={2,1,1,-2,2,-1,-2,-1};
	long long ans=0;
	int ccnt=0;
	vector<vector<int>> col(n+5,vector<int>(n+5)),freedom(n+5,vector<int>(n+5)),predate(n+5,vector<int>(n+5));
	vector<vector<pair<int,int>>> component(n*n+5);
	function<void(int,int,int)> dfs1=[&](int x,int y,int c)
	{
		component[c].emplace_back(x,y);
		col[x][y]=c;
		for(int d=0;d<4;d++)
		{
			int nx=x+dx[d],ny=y+dy[d];
			if(inb(nx,ny) and not col[nx][ny] and isbird(nx,ny))
			{
				dfs1(nx,ny,c);
			}
		}
	};
	function<void(int,int)> dfs2=[&](int x,int y)
	{
		freedom[x][y]=1;
		if(a[x][y]!=' ')return;
		for(int d=0;d<4;d++)
		{
			int nx=x+dx[d],ny=y+dy[d];
			if(inb(nx,ny) and not freedom[nx][ny])
			{
				dfs2(nx,ny);
			}
		}
	};
	vector<int> typecnt(256);
	set<string> uniq;
	vector<pair<int,int>> peaks;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(a[i][j]=='*')
			{
				//sun
				for(int d=0;d<8;d++)
				{
					for(int del=1;del<=n;del++)
					{
						int nx=i+dx[d]*del,ny=j+dy[d]*del;
						if(not inb(nx,ny))break;
						if(a[nx][ny]!=' ')
						{
							illume[nx][ny]=1;
							break;
						}
					}
				}
			}
			if(not col[i][j] and isbird(i,j))
			{
				//bird related
				dfs1(i,j,++ccnt);
			}
			if(a[i][j]=='^')
			{
				//house view up
				for(int t=1;t<=n;t++)
				{
					if(inb(i-t,j) and a[i-t][j]==' ')ans+=10;
					else break;
				}
				//house view down
				for(int t=1;t<=n;t++)
				{
					if(inb(i-t,j) and a[i-t][j]==' ')ans+=5;
					else break;
				}
			}
			if(inb(i-1,j-1) and inb(i+1,j+1))
			{
				//3x3 blocks
				string tmp="";
				tmp+=a[i][j];
				for(int d=0;d<8;d++)
					tmp+=a[i+dx[d]][j+dy[d]];
				uniq.insert(tmp);
			}
			if(a[i][j]=='!' or isbird(i,j))
			{
				//Animals I
				for(int d=0;d<4;d++)
				{
					int nx=i+dx[d],ny=j+dy[d];
					if(inb(nx,ny) and a[nx][ny]==' ')
						ans+=15;
				}
			}
			//Freedom
			if((i==1 or i==n or j==1 or j==n) and not freedom[i][j])
				dfs2(i,j);
			if(a[i][j]=='!')
			{
				//Chupacabra
				for(int d=0;d<8;d++)
				{
					int nx=i+ndx[d],ny=j+ndy[d];
					if(inb(nx,ny) and isbird(nx,ny))
						predate[nx][ny]=1;
				}
			}
			if(a[i][j]=='/' and inb(i,j+1) and a[i][j+1]=='\\')
			{
				//Peaks
				peaks.emplace_back(i,j);
				typecnt['P']++;
			}
			if(a[i][j]=='D')
			{
				//Drake / Grill
				int ok=0;
				for(int d=0;d<4;d++)
				{
					int nx=i+dx[d],ny=j+dy[d];
					if(inb(nx,ny) and a[nx][ny]=='G')
						ok=1;
				}
				if(ok)ans+=500;
			}
			if(a[i][j]=='G')
			{
				// Grill / Drake
				int ok=0;
				for(int d=0;d<4;d++)
				{
					int nx=i+dx[d],ny=j+dy[d];
					if(inb(nx,ny) and a[nx][ny]=='D')
						ok=1;
				}
				if(ok)ans+=50;
			}
			typecnt[a[i][j]]++;
		}
	}
//	cerr<<ans<<endl;
	ans+=uniq.size();
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
//			cerr<<i<<' '<<j<<' '<<freedom[i][j]<<' '<<predate[i][j]<<' '<<illume[i][j]<<endl;
			if(illume[i][j] and a[i][j]!='*')ans+=100;
			if(freedom[i][j] and a[i][j]!=' ')ans+=7;
			if(predate[i][j])ans+=200;
		}
	//Peaks
	for(auto [x1,y1]:peaks)
	{
		int maxpeakdist=0;
		for(auto [x2,y2]:peaks)
			maxpeakdist=max(maxpeakdist,abs(x1-x2)+abs(y1-y2));
//		cerr<<"P value "<<x1<<' '<<y1<<' '<<maxpeakdist<<endl;
		ans+=maxpeakdist*50;
	}
	//Minimum Frequency
	int minfreq=1000000000;
	if(typecnt['*'])minfreq=min(minfreq,typecnt['*']);
	if(typecnt['^'])minfreq=min(minfreq,typecnt['^']);
	if(typecnt['!'])minfreq=min(minfreq,typecnt['!']);
	if(typecnt['/'])minfreq=min(minfreq,typecnt['/']);
	if(typecnt['\\'])minfreq=min(minfreq,typecnt['\\']);
	if(typecnt['v'])minfreq=min(minfreq,typecnt['v']);
	if(typecnt['D'])minfreq=min(minfreq,typecnt['D']);
	if(typecnt['G'])minfreq=min(minfreq,typecnt['G']);
	if(typecnt['*']==minfreq)ans+=minfreq*10;
	if(typecnt['^']==minfreq)ans+=minfreq*10;
	if(typecnt['!']==minfreq)ans+=minfreq*10;
	if(typecnt['/']==minfreq)ans+=minfreq*10;
	if(typecnt['\\']==minfreq)ans+=minfreq*10;
	if(typecnt['v']==minfreq)ans+=minfreq*10;
	if(typecnt['D']==minfreq)ans+=minfreq*10;
	if(typecnt['G']==minfreq)ans+=minfreq*10;
	
	//Empty Fields
	ans+=typecnt[' '];
	
	//Animals II
	ans+=typecnt['!']*typecnt['v']*typecnt['D'];
	
	//House and grills
	ans+=min(typecnt['^'],typecnt['G'])*3;
	
	for(int c=1;c<=ccnt;c++)
	{
//		cerr<<"component "<<c<<endl;
		sort(component[c].begin(),component[c].end());
		int prex=0,prey=0;
		int nowlen=0,maxlen=0,peri=0;
		for(auto [x,y]:component[c])
		{
//			cerr<<"contains "<<x<<' '<<y<<endl;
			if(prex==x and prey==y-1)nowlen++;
			else maxlen=max(maxlen,nowlen),nowlen=1;
			prex=x;prey=y;
			for(int d=0;d<4;d++)
			{
				int nx=x+dx[d],ny=y+dy[d];
				if(not inb(nx,ny) or not isbird(nx,ny))
					peri++;
			}
		}
		maxlen=max(maxlen,nowlen);
//		cerr<<"peri "<<peri<<' '<<"maxlen "<<maxlen<<endl;
		ans+=peri*60;
		ans+=maxlen*500;
	}
	cout<<ans<<endl;
	return 0;
}