Problem: Little Vasya likes painting fractals very much.

He does it like this. First the boy cuts out a 2 × 2-cell square out of squared paper. Then he paints some cells black. The boy calls the cut out square a fractal pattern. Then he takes a clean square sheet of paper and paints a fractal by the following algorithm:

  1. He divides the sheet into four identical squares. A part of them is painted black according to the fractal pattern. 
  2. Each square that remained white, is split into 4 lesser white squares, some of them are painted according to the fractal pattern. Each square that remained black, is split into 4 lesser black squares. 



In each of the following steps step 2 repeats. To draw a fractal, the boy can make an arbitrary positive number of steps of the algorithm. But he need to make at least two steps. In other words step 2 of the algorithm must be done at least once. The resulting picture (the square with painted cells) will be a fractal. The figure below shows drawing a fractal (here boy made three steps of the algorithm).

<image>

One evening Vasya got very tired, so he didn't paint the fractal, he just took a sheet of paper, painted a n × m-cell field. Then Vasya paint some cells black. 

Now he wonders, how many squares are on the field, such that there is a fractal, which can be obtained as described above, and which is equal to that square. Square is considered equal to some fractal if they consist of the same amount of elementary not divided cells and for each elementary cell of the square corresponding elementary cell of the fractal have the same color.

Input

The first line contains two space-separated integers n, m (2 ≤ n, m ≤ 500) — the number of rows and columns of the field, correspondingly. 

Next n lines contain m characters each — the description of the field, painted by Vasya. Character "." represents a white cell, character "*" represents a black cell.

It is guaranteed that the field description doesn't contain other characters than "." and "*".

Output

On a single line print a single integer — the number of squares on the field, such that these squares contain a drawn fractal, which can be obtained as described above.

Examples

Input

6 11
......*.***
*.*.*....**
.***....*.*
..***.*....
.*.*.....**
......*.*..


Output

3


Input

4 4
..**
..**
....
....


Output

0

Note

The answer for the first sample is shown on the picture below. Fractals are outlined by red, blue and green squares.

<image>

The answer for the second sample is 0. There is no fractal, equal to the given picture.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int m, n;
int pow2[] = {1, 2, 4, 8, 16, 32, 64, 128, 256};
int c[501][501];
int s[501][501];
int f[501][501][9][16];
int dx[] = {0, 0, 1, 1};
int dy[] = {0, 1, 0, 1};
int getBit(int, int);
int get(int, int, int);
bool isFull(int, int, int);
bool isEmpty(int, int, int);
bool cal(int, int, int, int);
int main() {
  cin >> m >> n;
  for (int i = 0; i < m; i++) {
    string str;
    cin >> str;
    for (int j = 0; j < n; j++) {
      if (str[j] == '*') {
        c[i + 1][j + 1] = 1;
      }
      s[i + 1][j + 1] = s[i][j + 1] + s[i + 1][j] - s[i][j] + c[i + 1][j + 1];
    }
  }
  for (int mask = 0; mask < 16; mask++)
    for (int i = 1; i <= m; i++)
      for (int j = 1; j <= n; j++) {
        f[i][j][0][mask] = 1;
      }
  for (int mask = 0; mask < 16; mask++)
    for (int i = 1; i <= m; i++)
      for (int j = 1; j <= n; j++)
        if (i + 1 <= m && j + 1 <= n) {
          f[i][j][1][mask] = 1;
          for (int b = 0; b < 4; b++)
            if (getBit(mask, b) != c[i + dx[b]][j + dy[b]]) {
              f[i][j][1][mask] = 0;
              break;
            }
        }
  long long res = 0;
  for (int mask = 0; mask < 16; mask++)
    for (int k = 2; k < 9; k++)
      for (int i = 1; i <= m; i++)
        for (int j = 1; j <= n; j++) {
          if (cal(i, j, k, mask)) {
            f[i][j][k][mask] = 1;
          }
        }
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      for (int k = 2; k < 9; k++)
        for (int mask = 0; mask < 16; mask++) {
          if (f[i][j][k][mask]) {
            res++;
            break;
          }
        }
  cout << res << endl;
  return 0;
}
int get(int i, int j, int len) {
  int u = i + len - 1;
  int v = j + len - 1;
  return (s[u][v] - s[i - 1][v] - s[u][j - 1] + s[i - 1][j - 1]);
}
bool isFull(int i, int j, int len) { return (get(i, j, len) == len * len); }
bool isEmpty(int i, int j, int len) { return (get(i, j, len) == 0); }
bool cal(int i, int j, int k, int mask) {
  int len = 1 << k;
  int len2 = len / 2;
  if (i + len - 1 > m || j + len - 1 > n) {
    return false;
  }
  for (int b = 0; b < 4; b++)
    if (getBit(mask, b) && !isFull(i + len2 * dx[b], j + len2 * dy[b], len2)) {
      return false;
    } else if (getBit(mask, b) == 0 &&
               f[i + len2 * dx[b]][j + len2 * dy[b]][k - 1][mask] != 1) {
      return false;
    }
  return true;
}
int getBit(int x, int i) { return ((x & (1 << i)) != 0); }