#include <bits/stdc++.h> 
#define int long long
using namespace std;
const int N = 1000005, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}, Dx[] = {0, -1, -1, -1, 0, 1, 1, 1}, Dy[] = {1, 1, 0, -1, -1, -1, 0, 1};
int n, m, q[N], cnt[2005], vis[1005][1005], C, fl, f[1005][1005], v2[1005][1005];
char c[1005][1005];
struct Node{ int x, y;} a[N];
void dfs(int x, int y){
	if(vis[x][y]) return ;
	vis[x][y] = 1, a[++C] = {x, y};
	for(int i = 0; i < 4; i++) if(c[x + dx[i]][y + dy[i]] == '#') dfs(x + dx[i], y + dy[i]);
}
void dfs2(int x, int y){
	if(v2[x][y]) return ;
	v2[x][y] = 1;
	for(int i = 0; i < 8; i++) if(f[x + Dx[i]][y + Dy[i]]) dfs2(x + Dx[i], y + Dy[i]);
}
signed main(){
	int ans = -5;
	mt19937 rnd(114514);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cin >> c[i][j];
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) if(c[i][j] == '#' && !vis[i][j]){
		C = 0; int fl = 0; dfs(i, j);
		for(int j = 1; j <= 50; j++){
			int t1 = rnd() % C + 1, t2 = rnd() % C + 1;
			int x1 = a[t1].x, x2 = a[t2].x, y1 = a[t1].y, y2 = a[t2].y;
			double dis = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
			for(int i = 1; i <= C; i++){
				double op = abs((a[i].x - x1) * (y2 - y1) - (a[i].y - y1) * (x2 - x1));
				double ip = (a[i].x - x1) * (x2 - x1) + (a[i].y - y1) * (y2 - y1);
				if(op / dis <= 1.42 && ip >= 0 && ip <= dis * dis) f[a[i].x][a[i].y] = 1;
			}
			int cnt = 0;
			for(int i = 1; i <= C; i++) if(f[a[i].x][a[i].y] && !v2[a[i].x][a[i].y]) dfs2(a[i].x, a[i].y), cnt++;
			for(int i = 1; i <= C; i++) f[a[i].x][a[i].y] = v2[a[i].x][a[i].y] = 0;
			if(cnt > 1){ fl = 1; break;}
		}
		if(fl) ans += 5;
		else ans++;
	}
	cout << ans;
	return 0;
}