#include <bits/stdc++.h>
using namespace std;
struct node {
  int bir, iki;
};
int comp(void const *q, void const *w) {
  node q1 = *(node *)q;
  node w1 = *(node *)w;
  return q1.bir - w1.bir;
}
long long sum = 0;
int h, w;
int main() {
  scanf("%d %d", &w, &h);
  for (int i = 0; i <= w; i++)
    for (int o = 0; o <= h; o++) {
      int t = w - i;
      int p = min(o, h - o);
      if (t % 2 == 1) t--;
      t /= 2;
      sum += t * p;
    }
  cout << sum;
  return 0;
}
