#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 7;
const int mod = 1e9 + 7;
const int infi = (2e9 + 69);
const long long infy = (2e16 + 69);
const int base = 311;
const long long MM = 7ll * mod * mod;
const int addition = 1e5;
const double eps = 1e-8;
const string numd[10] = {"1110111", "0010010", "1011101", "1011011", "0111010",
                         "1101011", "1101111", "1010010", "1111111", "1111011"};
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
const double pi = 3.14159265358980;
const string P1 = "Alice";
const string P2 = "Bob";
const string spmcode =
    "My power does not end. Ask for aid and you will receive it.\n";
template <typename Num>
void maximize(Num &x, Num y) {
  x = mx(x, y);
}
template <typename Num>
void minimize(Num &x, Num y) {
  x = min(x, y);
}
void exit_with_runtime() {
  double x = 1.0 * clock() / CLOCKS_PER_SEC;
  cerr << "\n\n---------------------\nTime elapsed: " << x << " s.\n\n";
  exit(0);
}
void decorate() {
  cerr << "KienNguyen246\n";
  chrono::system_clock::time_point today = chrono::system_clock::now();
  time_t tt = chrono::system_clock::to_time_t(today);
  cerr << ctime(&tt);
  cerr << "\nProcessing...\n\n";
}
int m, n, a[505][505], f[505][505][20];
int G(int pos, int code) { return (((code >> pos) & 1) ? 15 : code); }
void Main_Process() {
  cin >> m >> n;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++) {
      char x;
      cin >> x;
      a[i][j] = (x == '*');
    }
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= 9; k++) f[i][j][k] = -1;
  for (int i = 1; i < m; i++)
    for (int j = 1; j < n; j++)
      f[i][j][1] =
          a[i][j] + a[i][j + 1] * 2 + a[i + 1][j] * 4 + a[i + 1][j + 1] * 8;
  for (int k = 2; (1 << k) <= min(m, n); k++)
    for (int i = 1; i + (1 << k) - 1 <= m; i++)
      for (int j = 1; j + (1 << k) - 1 <= n; j++)
        for (int x = 0; x <= 15; x++) {
          if (f[i][j][k - 1] == G(0, x) &&
              f[i][j + (1 << (k - 1))][k - 1] == G(1, x) &&
              f[i + (1 << (k - 1))][j][k - 1] == G(2, x) &&
              f[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1] == G(3, x)) {
            int g0 = G(0, x), g1 = G(1, x), g2 = G(2, x), g3 = G(3, x);
            if (g0 == 0)
              f[i][j][k] = 0;
            else {
              if (g0 == 15 && g1 == 15 && g2 == 15 && g3 == 15)
                f[i][j][k] = 15;
              else {
                if (g0 != 15)
                  f[i][j][k] = g0;
                else if (g1 != 15)
                  f[i][j][k] = g1;
                else if (g2 != 15)
                  f[i][j][k] = g2;
                else if (g3 != 15)
                  f[i][j][k] = g3;
              }
            }
          }
        }
  int res = 0;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 2; k <= 9; k++) res += (f[i][j][k] != -1);
  cout << res;
}
int main() {
  ios_base::sync_with_stdio(0);
  decorate();
  int test = 1;
  while (test--) {
    Main_Process();
  }
  exit_with_runtime();
}
