#include <bits/stdc++.h>
using namespace std;
int sums[555][555], n, m;
bool was[555][555][9][1 << 4];
bool isFract[555][555][9][1 << 4];
int dx[4] = {0, 0, 1, 1};
int dy[4] = {0, 1, 0, 1};
inline int getSum(int x1, int y1, int x2, int y2) {
  int res = sums[x2][y2];
  if (x1 > 0) res -= sums[x1 - 1][y2];
  if (y1 > 0) res -= sums[x2][y1 - 1];
  if (x1 > 0 and y1 > 0) res += sums[x1 - 1][y1 - 1];
  return res;
}
bool checkFract(int x, int y, int rank, int msk) {
  if (x + (1 << rank) - 1 >= n or y + (1 << rank) - 1 >= m) return false;
  if (rank == 0) {
    return getSum(x, y, x, y) == 0;
  }
  if (was[x][y][rank][msk]) return isFract[x][y][rank][msk];
  int d = (1 << rank) / 2;
  was[x][y][rank][msk] = true;
  bool &res = isFract[x][y][rank][msk];
  res = true;
  for (int i = 0; i < 4; i++) {
    if (msk & (1 << i)) {
      res &= getSum(x + dx[i] * d, y + dy[i] * d, x + dx[i] * d + d - 1,
                    y + dy[i] * d + d - 1) == d * d;
    } else {
      res &= checkFract(x + dx[i] * d, y + dy[i] * d, rank - 1, msk);
    }
  }
  return res;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      char buf;
      cin >> buf;
      sums[i][j] = buf == '*';
    }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) {
      if (j > 0) sums[i][j] += sums[i][j - 1];
      if (i > 0) sums[i][j] += sums[i - 1][j];
      if (i > 0 and j > 0) sums[i][j] -= sums[i - 1][j - 1];
    }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      for (int msk = 0; msk < (1 << 4); msk++) {
        for (int k = 2; k < 9; k++)
          if (checkFract(i, j, k, msk)) ans++;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
