#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define FINISH cerr << "FINISH!!!!" << endl;
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 550;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
void solve()
{
	int h, w, tot = 0;
	cin >> h >> w;
	vector<vector<char>> ch(h + 2, vector<char>(w + 2, '*'));
	vector<vector<int>> idx(h + 2, vector<int>(w + 2, 0));
	vector<PII> place((h + 2) * (w + 2), PII(0, 0));
	vector<int> col((h + 2) * (w + 2), 0);
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			cin >> ch[i][j];
			if (ch[i][j] == 'V' || ch[i][j] == 'H') {
				tot++;
				idx[i][j] = tot;
				place[tot] = PII(i, j);
				col[tot] = (ch[i][j] == 'H') ? 1 : 0;
			}
		}
	}
	vector<vector<vector<int>>> edge(2, vector<vector<int>>(tot + 3));
	function<PII(int, int, int, int)> search = [&](int x, int y, int dx,
												   int dy) {
		int nowx = x, nowy = y, cnt = 0;
		while (1) {
			nowx += dx, nowy += dy;
			if (ch[nowx][nowy] == '#')
				break;
			if (ch[nowx][nowy] == '\\') {
				swap(dx, dy);
				cnt++;
			}
			else if (ch[nowx][nowy] == '/') {
				swap(dx, dy);
				dx = -dx, dy = -dy;
				cnt++;
			}
			else if (ch[nowx][nowy] == '*') {
				dx = -dx, dy = -dy;
			}
			if (ch[nowx][nowy] == 'H' || ch[nowx][nowy] == 'V') {
				if (cnt % 2 == 1) {
					return PII(idx[nowx][nowy], 1);
				}
				else {
					return PII(idx[nowx][nowy], 0);
				}
			}
		}
		return PII(-1, -1);
	};
	vector<vector<int>> prohibit(tot + 3, vector<int>(2, 0));
	function<void(int, int)> dfs = [&](int x, int y) {
		int dx, dy;
		PII res1 = search(x, y, 1, 0), res2 = search(x, y, -1, 0);
		if (res1.fir != -1 && res2.fir != -1) {
			edge[res1.sec][idx[x][y]].push_back(res1.fir);
			edge[res1.sec][res1.fir].push_back(idx[x][y]);
			edge[res2.sec][idx[x][y]].push_back(res2.fir);
			edge[res2.sec][res2.fir].push_back(idx[x][y]);
			prohibit[idx[x][y]][0] = 1;
		}
		res1 = search(x, y, 0, 1), res2 = search(x, y, 0, -1);
		if (res1.fir != -1 && res2.fir != -1) {
			edge[res1.sec][idx[x][y]].push_back(res1.fir);
			edge[res1.sec][res1.fir].push_back(idx[x][y]);
			edge[res2.sec][idx[x][y]].push_back(res2.fir);
			edge[res2.sec][res2.fir].push_back(idx[x][y]);
			prohibit[idx[x][y]][1] = 1;
		}
	};
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			if (ch[i][j] == 'H' || ch[i][j] == 'V') {
				dfs(i, j);
				if (prohibit[idx[i][j]][0] == 0 &&
					prohibit[idx[i][j]][1] == 0) {
					cout << "-1" << endl;
					return;
				}
			}
		}
	}
	vector<vector<int>> block(tot + 3);
	vector<int> vis(tot + 3, 0);
	function<void(int, int)> find = [&](int x, int res) {
		if (vis[x])
			return;
		vis[x] = res;
		block[res].push_back(x);
		for (auto to : edge[0][x]) {
			if (vis[to])
				continue;
			find(to, res);
		}
	};
	int now = 0;
	for (int i = 1; i <= tot; i++) {
		if (!vis[i])
			find(i, ++now);
	}
	int ans = 0;
	vector<vector<int>> val(tot + 3, vector<int>(2, 0));
	for (int i = 1; i <= now; i++) {
		// debug(i);
		int cnt0 = 0, cnt1 = 0;
		for (auto x : block[i]) {
			if (prohibit[x][0] == 0) {
				cnt0 = inf;
			}
			if (prohibit[x][1] == 0) {
				cnt1 = inf;
			}
			if (cnt0 <= inf && col[x] == 1)
				cnt0++;
			if (cnt1 <= inf && col[x] == 0)
				cnt1++;
		}
		val[i][0] = cnt0;
		val[i][1] = cnt1;
	}
	vector<vector<int>> edge1(tot + 3);
	int cnt = 0;
	for (int i = 1; i <= now; i++) {
		vector<int> fl(tot + 3, 0);
		for (auto x : block[i]) {
			cnt++;
			for (auto to : edge[1][x]) {
				if (vis[x] != vis[to] && fl[vis[to]] == 0) {
					fl[vis[to]] = 1;
					edge1[i].push_back(vis[to]);
				}
				if (vis[x] == vis[to]) {
					cout << "-1" << endl;
					return;
				}
			}
		}
	}
	assert(cnt == tot);
	int ans1 = 0, ans2 = 0;
	vector<int> las;
	function<int(int, int)> getcol = [&](int x, int c) {
		vis[x] = 1, col[x] = c;
		las.push_back(x);
		int sum = val[x][c];
		for (int to : edge1[x]) {
			if (vis[to]) {
				if (col[to] == col[x]) {
					return -1;
				}
				continue;
			}
			int noww = getcol(to, c ^ 1);
			if (noww == -1)
				return -1;
			sum += noww;
		}
		return sum;
	};
	for (int i = 1; i <= now; i++) {
		vis[i] = col[i] = 0;
	}
	for (int i = 1; i <= now; i++) {
		int sum1 = 0, sum2 = 0;
		if (vis[i])
			continue;
		sum1 = getcol(i, 0);
		if (sum1 == -1) {
			cout << "-1" << endl;
			return;
		}
		for (auto x : las) {
			vis[x] = col[x] = 0;
		}
		las.clear();
		sum2 = getcol(i, 1);
		ans1 += min(sum1, sum2);
		las.clear();
	}
	if (ans1 >= inf)
		ans1 = -1;
	cout << ans1 << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}