#include <bits/stdc++.h>
template <typename T>
T inline SQR(const T &a) {
  return a * a;
}
template <typename T>
T inline ABS(const T &a) {
  return a < 0 ? -a : a;
}
const double EPS = 1e-9;
inline int SGN(double a) {
  return ((a > EPS) ? (1) : ((a < -EPS) ? (-1) : (0)));
}
inline int CMP(double a, double b) { return SGN(a - b); }
using namespace std;
string grid[501];
int sm[501][501];
char aok[10][16][501][501];
int get(int x1, int y1, int x2, int y2) {
  int res = sm[x2][y2];
  if (x1) res -= sm[x1 - 1][y2];
  if (y1) res -= sm[x2][y1 - 1];
  if (x1 && y1) res += sm[x1 - 1][y1 - 1];
  return res;
}
bool ok(int gr, int pat, int x1, int y1) {
  if (gr == 1) return (grid[x1][y1] == '.');
  char &old = aok[int(log2(gr))][pat][x1][y1];
  if (old) return ((old == 1) ? true : false);
  int x2 = x1 + gr - 1;
  int y2 = y1 + gr - 1;
  int xm = x1 + (gr / 2) - 1;
  int ym = y1 + (gr / 2) - 1;
  int need = (gr / 2) * (gr / 2);
  if (pat & 1) {
    int black = get(x1, y1, xm, ym);
    if (black != need) {
      old = 2;
      return false;
    }
  } else {
    if (!ok(gr / 2, pat, x1, y1)) {
      old = 2;
      return false;
    }
  }
  if (pat & 2) {
    int black = get(x1, ym + 1, xm, y2);
    if (black != need) {
      old = 2;
      return false;
    }
  } else {
    if (!ok(gr / 2, pat, x1, ym + 1)) {
      old = 2;
      return false;
    }
  }
  if (pat & 4) {
    int black = get(xm + 1, y1, x2, ym);
    if (black != need) {
      old = 2;
      return false;
    }
  } else {
    if (!ok(gr / 2, pat, xm + 1, y1)) {
      old = 2;
      return false;
    }
  }
  if (pat & 8) {
    int black = get(xm + 1, ym + 1, x2, y2);
    if (black != need) {
      old = 2;
      return false;
    }
  } else {
    if (!ok(gr / 2, pat, xm + 1, ym + 1)) {
      old = 2;
      return false;
    }
  }
  old = 1;
  return true;
}
int main(int argc, char *argv[]) {
  ios::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) cin >> grid[i];
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      sm[i][j] = (i ? sm[i - 1][j] : 0) + (j ? sm[i][j - 1] : 0) -
                 ((i && j) ? sm[i - 1][j - 1] : 0) +
                 ((grid[i][j] == '*') ? 1 : 0);
    }
  int gr = max(n, m);
  gr = log2(gr);
  gr = (1 << gr);
  long long ans = 0;
  while (gr >= 4) {
    for (int i = 0; i < n; ++i) {
      if (i + gr - 1 >= n) break;
      for (int j = 0; j < m; ++j) {
        if (j + gr - 1 >= m) break;
        for (int pat = 0; pat < 16; pat++) {
          if (ok(gr, pat, i, j)) {
            ans++;
            break;
          }
        }
      }
    }
    gr >>= 1;
  }
  cout << ans << "\n";
  return 0;
}
