#include <bits/stdc++.h>
using namespace std;
char s[555][555];
bool dp[555][555][20][10];
int sum[555][555];
int main() {
  int n, m;
  int ans = 0;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) cin >> s[i] + 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
      if (s[i][j] == '*') sum[i][j]++;
    }
  }
  for (int i = 1; i < n; i++) {
    for (int j = 1; j < m; j++) {
      int t = 0;
      if (s[i][j] == '*') t += 8;
      if (s[i][j + 1] == '*') t += 4;
      if (s[i + 1][j] == '*') t += 2;
      if (s[i + 1][j + 1] == '*') t += 1;
      dp[i][j][t][1] = 1;
    }
  }
  for (int l = 2; l < 10; l++) {
    int len = (1 << l);
    for (int t = 0; t < 16; t++) {
      int tmp = t;
      int flag1 = 0, flag2 = 0, flag3 = 0, flag4 = 0;
      if (tmp >= 8) flag1 = 1, tmp -= 8;
      if (tmp >= 4) flag2 = 1, tmp -= 4;
      if (tmp >= 2) flag3 = 1, tmp -= 2;
      if (tmp >= 1) flag4 = 1, tmp -= 1;
      for (int sx = 1; sx <= n; sx++) {
        for (int sy = 1; sy <= m; sy++) {
          int ex = sx + len;
          int ey = sy + len;
          int midx = sx + len / 2;
          int midy = sy + len / 2;
          if (ex > n + 1 || ey > m + 1) continue;
          if (flag1 && sum[midx - 1][midy - 1] - sum[sx - 1][midy - 1] -
                               sum[midx - 1][sy - 1] + sum[sx - 1][sy - 1] !=
                           len * len / 4)
            continue;
          if (flag2 && sum[midx - 1][ey - 1] - sum[sx - 1][ey - 1] -
                               sum[midx - 1][midy - 1] +
                               sum[sx - 1][midy - 1] !=
                           len * len / 4)
            continue;
          if (flag3 && sum[ex - 1][midy - 1] - sum[midx - 1][midy - 1] -
                               sum[ex - 1][sy - 1] + sum[midx - 1][sy - 1] !=
                           len * len / 4)
            continue;
          if (flag4 && sum[ex - 1][ey - 1] - sum[midx - 1][ey - 1] -
                               sum[ex - 1][midy - 1] +
                               sum[midx - 1][midy - 1] !=
                           len * len / 4)
            continue;
          if (!flag1 && dp[sx][sy][t][l - 1] == 0) continue;
          if (!flag2 && dp[sx][midy][t][l - 1] == 0) continue;
          if (!flag3 && dp[midx][sy][t][l - 1] == 0) continue;
          if (!flag4 && dp[midx][midy][t][l - 1] == 0) continue;
          ans++;
          dp[sx][sy][t][l] = 1;
        }
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
