#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

char c[1005][1005];

char w[] = "hehe";

int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};

int main()
{
	int n,m;
	cin >> n >> m;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			cin >> c[i][j];
		}
	}
	int cnt = 0;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			for(int k = 0;k <= 3;k++)
			{
				int lx = i + 3 * dx[k];
				int ly = j + 3 * dy[k];
				if(1 <= lx && lx <= n && 1 <= ly && ly <= n)
				{
					bool flag = 0;
					for(int l = 0;l <= 3;l++)
					{
						int nx = i + l * dx[k];
						int ny = j + l * dy[k];
						if(c[nx][ny] != w[l]) flag = 1;
					}
					if(!flag)
					{
						cnt++;
					}
				}
			}
		}
	}
	cout << cnt;
	return 0;
}