#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 100500;
const int maxn = 505;
long long p = 10099, q = 424243;
long long pp[maxn], pq[maxn];
int n, m;
int a[maxn][maxn];
long long h[maxn][maxn];
void buildh() {
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(m); j++) {
      h[i][j] = a[i][j] + 8;
      if (i) h[i][j] += p * h[i - 1][j];
      if (j) h[i][j] += q * h[i][j - 1];
      if (i && j) h[i][j] -= p * q * h[i - 1][j - 1];
    }
  pp[0] = pq[0] = 1;
  for (int i = 0; i < (int)(maxn); i++)
    if (i) {
      pp[i] = pp[i - 1] * p;
      pq[i] = pq[i - 1] * q;
    }
}
long long geth(int x1, int y1, int x2, int y2) {
  long long s = h[x2][y2];
  if (x1) s -= h[x1 - 1][y2] * pp[x2 - x1 + 1];
  if (y1) s -= h[x2][y1 - 1] * pq[y2 - y1 + 1];
  if (x1 && y1) s += h[x1 - 1][y1 - 1] * pp[x2 - x1 + 1] * pq[y2 - y1 + 1];
  return s;
}
long long th[maxn][maxn];
long long geth(const vector<vector<int> > &a) {
  int n = a.size();
  for (int i = 0; i < (int)(n); i++)
    for (int j = 0; j < (int)(n); j++) {
      th[i][j] = a[i][j] + 8;
      if (i) th[i][j] += p * th[i - 1][j];
      if (j) th[i][j] += q * th[i][j - 1];
      if (i && j) th[i][j] -= p * q * th[i - 1][j - 1];
    }
  return th[n - 1][n - 1];
}
map<long long, int> frac;
void buildFracs() {
  bool f[2][2];
  for (int mask = 0; mask < (int)(16); mask++) {
    f[0][0] = mask & 1;
    f[0][1] = mask & 2;
    f[1][0] = mask & 4;
    f[1][1] = mask & 8;
    vector<vector<int> > a(2, vector<int>(2));
    for (int i = 0; i < (int)(2); i++)
      for (int j = 0; j < (int)(2); j++) a[i][j] = f[i][j];
    int n = 2;
    while (n < 250) {
      vector<vector<int> > b(n * 2, vector<int>(n * 2, 0));
      for (int i = 0; i < (int)(2); i++)
        for (int j = 0; j < (int)(2); j++) {
          if (f[i][j]) {
            for (int x = 0; x < (int)(n); x++)
              for (int y = 0; y < (int)(n); y++) b[i * n + x][j * n + y] = 1;
          } else {
            for (int x = 0; x < (int)(n); x++)
              for (int y = 0; y < (int)(n); y++)
                b[i * n + x][j * n + y] = a[x][y];
          }
        }
      frac[geth(b)]++;
      a = b;
      n *= 2;
    }
  }
}
void scan() {
  cin >> n >> m;
  char t[maxn];
  for (int i = 0; i < (int)(n); i++) {
    cin >> t;
    for (int j = 0; j < (int)(m); j++) a[i][j] = t[j] == '*';
  }
}
void solve() {
  buildh();
  int s = 0;
  for (int a = 4; a < 500; a *= 2)
    for (int i = 0; i < (int)(n - a + 1); i++)
      for (int j = 0; j < (int)(m - a + 1); j++)
        s += frac[geth(i, j, i + a - 1, j + a - 1)];
  cout << s << endl;
}
int main() {
  buildFracs();
  scan();
  solve();
  return 0;
}
